On the public citation graph

3-D Minimum Energy Broadcasting

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11427186_4openalex-snapshot
The “Real” Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting
inferredcites →https://doi.org/10.1007/11523468_92openalex-snapshot
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-36136-7_30openalex-snapshot
New Results for Energy-Efficient Broadcasting in Wireless Networks
inferredcites →https://doi.org/10.1007/3-540-44693-1_11openalex-snapshot
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
inferredcites →https://doi.org/10.1007/978-3-540-24693-0_71openalex-snapshot
Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem
inferredcites →https://doi.org/10.1007/978-3-540-28634-9_15openalex-snapshot
Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks
inferredcites →https://doi.org/10.1007/978-3-642-22450-8_16openalex-snapshot
A New Coverage Improvement Algorithm Based on Motility Capability of Directional Sensor Nodes
inferredcites →https://doi.org/10.1007/bf02125348openalex-snapshot
On random minimum length spanning trees
inferredcites →https://doi.org/10.1016/s0304-3975(02)00538-8openalex-snapshot
The minimum broadcast range assignment problem on linear multi-hop wireless networks
inferredcites →https://doi.org/10.1023/a:1020381720601openalex-snapshot
Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1109/38.403829openalex-snapshot
Delaunay triangulation in three dimensions
inferredcites →https://doi.org/10.1109/infcom.2000.832232openalex-snapshot
On the construction of energy-efficient broadcast and multicast trees in wireless networks
inferredcites →https://doi.org/10.1109/infcom.2001.916310openalex-snapshot
Minimum-energy broadcast routing in static ad hoc wireless networks
inferredcites →https://doi.org/10.1109/ipdps.2003.1213407openalex-snapshot
On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks
inferredcites →https://doi.org/10.1109/wiopt.2005.16openalex-snapshot
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks
inferredcites →https://doi.org/10.1109/wiopt.2005.51openalex-snapshot
Tighter Bounds for the Minimum Energy Broadcasting Problem
inferredcites →https://doi.org/10.1145/1022630.1022644openalex-snapshot
Improved approximation results for the minimum energy broadcasting problem
inferredcites →https://doi.org/10.1145/1023756.1023769openalex-snapshot
Energy-efficient broadcasting in ad-hoc networks
inferredcites →https://doi.org/10.1145/1187436.1216587openalex-snapshot
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
inferredcites →https://doi.org/10.1145/513800.513815openalex-snapshot
Constructing minimum-energy broadcast trees in wireless ad hoc networks
inferredcites →https://doi.org/10.1145/566282.566304openalex-snapshot
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_233openalex-snapshot
Minimum Energy Broadcasting in Wireless Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_12openalex-snapshot
Energy Efficiency in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_233openalex-snapshot
Minimum Energy Broadcasting in Wireless Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-16194-1_1openalex-snapshot
A Role of Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_40openalex-snapshot
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2007.06.003openalex-snapshot
3-Dimensional minimum energy broadcasting problem
inferred← citeshttps://doi.org/10.1109/mass.2014.81openalex-snapshot
Minimum Power Broadcast: Fast Variants of Greedy Approximations
inferred← citeshttps://doi.org/10.1109/tmc.2006.151openalex-snapshot
Energy and Spatial Reuse Efficient Network-Wide Real-Time Data Broadcasting in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tnet.2012.2223483openalex-snapshot
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1145/1216993.1217002openalex-snapshot
Energetic performance of service-oriented multi-radio networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.