Power Optimization for Connectivity Problems

DOI10.1007/11496915_26MaRDI QIDQ3596355zbMATH OpenOpenAlexFDO

Authors Mohammad T. Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov

Publication date 30 August 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496915_26

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Connectivity (05C40)

Recommendations

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

Cited in

(9)

• An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
• On Minimum Power Connectivity Problems
• Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
• The connected Vietoris powerlocale
• Approximating minimum-power edge-covers and 2,3-connectivity
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
• On minimum power connectivity problems
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths

This page was built for publication: Power Optimization for Connectivity Problems

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