On the public citation graph

An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

0 signed · 107 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.1006/inco.1998.2754openalex-snapshot
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
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/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.1016/0022-0000(92)90042-hopenalex-snapshot
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
inferredcites →https://doi.org/10.1016/0167-6377(89)90039-4openalex-snapshot
Cost of sequential connection for points in space
inferredcites →https://doi.org/10.1016/j.cor.2004.04.017openalex-snapshot
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
inferredcites →https://doi.org/10.1016/s0304-3975(98)00223-0openalex-snapshot
Power consumption in packet radio networks
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/milcom.1998.722569openalex-snapshot
On some challenges and design choices in ad-hoc communications
inferredcites →https://doi.org/10.1109/wiopt.2005.51openalex-snapshot
Tighter Bounds for the Minimum Energy Broadcasting Problem
inferredcites →https://doi.org/10.1137/0116001openalex-snapshot
Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferredcites →https://doi.org/10.1145/1022630.1022644openalex-snapshot
Improved approximation results for the minimum energy broadcasting problem
inferredcites →https://doi.org/10.1145/72981.73005openalex-snapshot
Multiple communication in multi-hop radio networks
inferredcites →https://doi.org/10.1201/9780203323687openalex-snapshot
Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks
inferredcites →https://doi.org/10.5860/choice.33-1558openalex-snapshot
Wireless information networks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20222openalex-snapshot
Analysis and computational study of several integer programming formulations for minimum‐energy multicasting in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1007/11561354_3openalex-snapshot
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/11780823_18openalex-snapshot
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
inferred← citeshttps://doi.org/10.1007/11780823_19openalex-snapshot
3-D Minimum Energy Broadcasting
inferred← citeshttps://doi.org/10.1007/11922377_10openalex-snapshot
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_234openalex-snapshot
Minimum Energy Cost Broadcasting in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-6111-2_10openalex-snapshot
Compact Integer Programming Models for Power-optimal Trees in Ad Hoc Wireless 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-4614-1701-9openalex-snapshot
Design and Analysis of Approximation Algorithms
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-031-32733-9_12openalex-snapshot
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_3openalex-snapshot
Awake Complexity of Distributed Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_24openalex-snapshot
Shared Multicast Trees in Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_25openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_23openalex-snapshot
Sharing the Cost of Multicast Transmissions in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69170-9_19openalex-snapshot
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
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.1007/978-3-540-75142-7_21openalex-snapshot
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_18openalex-snapshot
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_3openalex-snapshot
Sensor Networks Continue to Puzzle: Selected Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78604-7_6openalex-snapshot
Evolutionary Local Search for the Minimum Energy Broadcast Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_34openalex-snapshot
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_19openalex-snapshot
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
inferred← citeshttps://doi.org/10.1007/978-3-540-92695-5_1openalex-snapshot
Nested Partitioning for the Minimum Energy Broadcast Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_13openalex-snapshot
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_32openalex-snapshot
MANETS: High Mobility Can Make Up for Low Transmission Power
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_49openalex-snapshot
Efficient k-Shot Broadcasting in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_19openalex-snapshot
Information Spreading in Dynamic Networks: An Analytical Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-16988-5_4openalex-snapshot
Minimum Energy Broadcast on Rectangular Grid Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31869-6_11openalex-snapshot
Minimum Total Communication Power Connected Dominating Set in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_4openalex-snapshot
Collecting Information by Power-Aware Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_9openalex-snapshot
Data Delivery by Energy-Constrained Mobile Agents
inferred← citeshttps://doi.org/10.1007/s00446-008-0058-0openalex-snapshot
Time efficient k-shot broadcasting in known topology radio networks
inferred← citeshttps://doi.org/10.1007/s00453-014-9939-8openalex-snapshot
Convergecast and Broadcast by Power-Aware Mobile Agents
inferred← citeshttps://doi.org/10.1007/s00453-019-00567-8openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
inferred← citeshttps://doi.org/10.1007/s10878-006-9033-5openalex-snapshot
Total energy optimal multicasting in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1007/s10878-007-9100-6openalex-snapshot
OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11276-009-0163-4openalex-snapshot
Maximum-residual multicasting and aggregating in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11276-010-0287-6openalex-snapshot
Novel algorithms for the network lifetime problem in wireless settings
inferred← citeshttps://doi.org/10.1007/s11590-011-0375-2openalex-snapshot
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas
inferred← citeshttps://doi.org/10.1007/s13174-012-0073-zopenalex-snapshot
Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs
inferred← citeshttps://doi.org/10.1016/j.adhoc.2007.06.003openalex-snapshot
3-Dimensional minimum energy broadcasting problem
inferred← citeshttps://doi.org/10.1016/j.adhoc.2007.06.006openalex-snapshot
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms
inferred← citeshttps://doi.org/10.1016/j.adhoc.2008.03.008openalex-snapshot
On construction of minimum energy k-fault resistant topologies
inferred← citeshttps://doi.org/10.1016/j.adhoc.2010.08.016openalex-snapshot
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.05.004openalex-snapshot
Interference-free energy efficient scheduling in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.12.019openalex-snapshot
Heuristic routing with bandwidth and energy constraints in sensor networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.06.005openalex-snapshot
Homogeneous 2-hop broadcast in 2D
inferred← citeshttps://doi.org/10.1016/j.dam.2015.08.021openalex-snapshot
Efficient k-shot broadcasting in radio networks
inferred← citeshttps://doi.org/10.1016/j.endm.2016.10.002openalex-snapshot
The Shared Broadcast Tree Problem and MST
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.016openalex-snapshot
Weighted broadcast in linear radio networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.02.012openalex-snapshot
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm
inferred← citeshttps://doi.org/10.1016/j.jnca.2012.03.005openalex-snapshot
A weight-value algorithm for finding connected dominating sets in a MANET
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.09.004openalex-snapshot
Sharing the cost of multicast transmissions in wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.005openalex-snapshot
Minimum-Energy Broadcast and disk cover in grid wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114279openalex-snapshot
The energy complexity of diameter and minimum cut computation in bounded-genus networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195566openalex-snapshot
Energy efficient broadcast in multiradio multichannel wireless networks
inferred← citeshttps://doi.org/10.1109/mass.2014.81openalex-snapshot
Minimum Power Broadcast: Fast Variants of Greedy Approximations
inferred← citeshttps://doi.org/10.1109/tc.2010.50openalex-snapshot
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2009.54openalex-snapshot
A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.231openalex-snapshot
Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2014653openalex-snapshot
Low-Energy Fault-Tolerant Bounded-Hop Broadcast in Wireless 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.1109/tnet.2019.2928798openalex-snapshot
The Gain of Energy Accumulation in Multi-Hop Wireless Network Broadcast
inferred← citeshttps://doi.org/10.1109/tpds.2008.57openalex-snapshot
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2010.77openalex-snapshot
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1109/tpds.2012.314openalex-snapshot
Aggregation Latency-Energy Tradeoff in Wireless Sensor Networks with Successive Interference Cancellation
inferred← citeshttps://doi.org/10.1109/tro.2012.2183069openalex-snapshot
Simultaneous Localization of Multiple Unknown and Transient Radio Sources Using a Mobile Robot
inferred← citeshttps://doi.org/10.1109/wasa.2007.42openalex-snapshot
Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/wasa.2007.71openalex-snapshot
Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/wiopt.2011.5930056openalex-snapshot
Interference-free energy efficient scheduling in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1137/23m1545975openalex-snapshot
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
inferred← citeshttps://doi.org/10.1142/9789812836243_0010openalex-snapshot
Range Assignment Problem in Wireless Network
inferred← citeshttps://doi.org/10.1145/1187436.1216587openalex-snapshot
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
inferred← citeshttps://doi.org/10.1145/1378533.1378569openalex-snapshot
Energy-optimal distributed algorithms for minimum spanning trees
inferred← citeshttps://doi.org/10.1145/1454503.1454563openalex-snapshot
Minimum-energy broadcast in random-grid ad-hoc networks
inferred← citeshttps://doi.org/10.1145/1735223.1735245openalex-snapshot
Energy-efficient algorithms
inferred← citeshttps://doi.org/10.1145/3212734.3212774openalex-snapshot
The Energy Complexity of Broadcast
inferred← citeshttps://doi.org/10.1145/3737897.3767290openalex-snapshot
Differentially Private Matroid Bandits for Online Network Topology Optimization
inferred← citeshttps://doi.org/10.17577/ijertv4is041286openalex-snapshot
Survey on Energy Efficient Algorithms for AODV
inferred← citeshttps://doi.org/10.48550/arxiv.0804.3902openalex-snapshot
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1113openalex-snapshot
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
inferred← citeshttps://doi.org/10.48550/arxiv.1705.01465openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04071openalex-snapshot
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612121openalex-snapshot
Power Assignment Problems in Wireless Communication
inferred← citeshttps://doi.org/10.5220/0006583601840191openalex-snapshot
Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination
inferred← citeshttps://doi.org/10.5555/1769087.1769114openalex-snapshot
Minimum-energy broadcast with few senders
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.