Minimum Power Broadcast: Fast Variants of Greedy Approximations

No abstract is available for this paper.

• Publication year

  2014

• Venue

  2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems

• Publication date

  2014-10-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/MASS.2014.81
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Faster approximation for Symmetric Min-Power Broadcast

  2013cited by this paper
• Improved PSOR algorithm for minimum power multicast tree problem in wireless ad hoc networks

  2010cited by this paper
• New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

  2009influential reference
• Evolutionary Local Search for the Minimum Energy Broadcast Problem

  2008cited by this paper
• Nested Partitioning for the Minimum Energy Broadcast Problem

  2008cited by this paper
• An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

  2008cited by this paper
• Tightening the upper bound for the minimum energy broadcasting

  2008cited by this paper
• Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks

  2008cited by this paper
• Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks

  2008cited by this paper
• Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

  2008cited by this paper
• An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks

  2007influential reference
• The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

  2007cited by this paper
• GENSEN: A Topology Generator for Real Wireless Sensor Networks Deployment

  2007cited by this paper
• 3-D Minimum Energy Broadcasting

  2006cited by this paper
• Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms

  2006cited by this paper
• The minimum-energy broadcast problem in symmetric wireless ad hoc networks

  2006cited by this paper
• Tighter bounds for the minimum energy broadcasting problem

  2005cited by this paper
• Topology control in wireless ad hoc and sensor networks

  2005cited by this paper
• An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

  2005cited by this paper
• Energy-Efficient Broadcasting in All-Wireless Networks

  2005influential reference
• On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks

  2005cited by this paper
• Energy efficient broadcast routing in static ad hoc wireless networks

  2004cited by this paper
• Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem

  2004cited by this paper
• Improved Approximation Results for the Minimum Energy Broadcasting Problem

  2004cited by this paper
• Topology Control Problems under Symmetric and Asymmetric Power Thresholds

  2003cited by this paper
• Energy-Efficient Wireless Network Design

  2003cited by this paper
• Network Lifetime and Power Assignment in ad hoc Wireless Networks

  2003influential reference
• Constructing minimum-energy broadcast trees in wireless ad hoc networks

  2002cited by this paper
• New Results for Energy-Efficient Broadcasting in Wireless Networks

  2002cited by this paper
• Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks

  2002cited by this paper
• On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

  2001cited by this paper
• MinimumSpanning Trees in HypergraphsTobias

  2001cited by this paper
• Minimum-energy broadcast routing in static ad hoc wireless networks

  2001cited by this paper
• Introduction to algorithms [2nd ed.]

  2001cited by this paper
• Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

  2000cited by this paper
• Power-Aware Broadcasting in Mobile Ad Hoc Networks∗

  1999cited by this paper
• Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

  1998cited by this paper
• Combinatorial optimization

  1997cited by this paper
• Wireless Communications: Principles and Practice

  1996cited by this paper
• Better approximation bounds for the network and Euclidean Steiner tree problems

  1996cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• A nearly best-possible approximation algorithm for node-weighted Steiner trees

  1993cited by this paper
• Combinatorial Optimization

  1992cited by this paper
• Fast Algorithms for Finding Nearest Common Ancestors

  1984cited by this paper
• On-Line Computation of Transitive Closures of Graphs

  1983cited by this paper
• Data structures and network algorithms

  1983cited by this paper
• An analysis of the greedy algorithm for the submodular set covering problem

  1982cited by this paper

• Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks

  2016cites this paper