Minimum energy broadcasting in wireless networks (extended abstract)

This paper considers a special case of MECBS(Minimum Energy Consumption Broadcast Subgraph) problem, which is motivated by minimum energy braodcasting in wireless networks in a city area like as in Manhattan in NY. First, this problem is proved to be NP-hard, and then MST, an algorithm based on minimum spanning tree, is 4-approximation algorithm for this problem.