On Minimum Power Connectivity Problems

DOI10.1007/978-3-540-75520-3_10MaRDI QIDQ3527202zbMATH OpenOpenAlexFDO

Authors Yuval Lando, Zeev Nutov

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• On minimum power connectivity problems
• Power optimization for connectivity problems
• Power Optimization for Connectivity Problems
• Approximating Minimum-Power Degree and Connectivity Problems
• Approximating minimum-power degree and connectivity problems

Cited in

(17)

• 1.61-approximation for min-power strong connectivity with two power levels
• On minimum power connectivity problems
• Minimum shared‐power edge cut
• Power Optimization for Connectivity Problems
• On min-power Steiner tree
• Min-power strong connectivity
• An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
• Survivable network design problems in wireless networks
• Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
• Hardness of minimum barrier shrinkage and minimum installation path
• Power assignment for k-connectivity in wireless ad hoc networks
• Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
• Approximate min-power strong connectivity
• Minimum power partial multi-cover on a line
• Approximating minimum-power degree and connectivity problems
• A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
• Approximating minimum-power edge-covers and 2,3-connectivity

This page was built for publication: On Minimum Power Connectivity Problems

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