A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

DOI10.1016/S0020-0190(02)00484-2MaRDI QIDQ1007590zbMATH OpenOpenAlexFDO

Authors I. Caragiannis, C. Kaklamanis, Panagiotis Kanellopoulos

Publication date 23 March 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(02)00484-2

zbMATH Keywords

approximation algorithmsgraph algorithmswireless networks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1979511
• Euro-Par 2004 Parallel Processing
• scientific article; zbMATH DE number 1688358
• An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
• Minimum-energy broadcasting in static ad hoc wireless networks

Cites work

• Approximation algorithms for connected dominating sets
• scientific article; zbMATH DE number 1688358 (Why is no real title available?)
• Improved methods for approximating node weighted Steiner trees and connected dominating sets.
• Minimum-energy broadcasting in static ad hoc wireless networks
• Power consumption in packet radio networks

Cited in

(5)

• scientific article; zbMATH DE number 1688358 (Why is no real title available?)
• Energy consumption minimization in ad hoc wireless and multi-interface networks
• scientific article; zbMATH DE number 1979511 (Why is no real title available?)
• Euro-Par 2004 Parallel Processing
• Online range assignment problems

This page was built for publication: A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007590)