Abstract
Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted Connected Dominating Set. We also show that an important special instance of the problem can be solved in polynomial time, solving an open problem of Clementi et al. [2]. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Caragiannis, I., Kaklamanis, C., & Kanellopoulos, P. (2002). New results for energy-efficient broadcasting in wireless networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 332–343). https://doi.org/10.1007/3-540-36136-7_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
