Power optimization for connectivity problems
DOI10.1007/S10107-006-0057-5zbMATH Open1192.90173OpenAlexW2162071758MaRDI QIDQ877193FDOQ877193
Authors: Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Mohammad T. Hajiaghayi 
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0057-5
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Optimization, approximation, and complexity classes
- An application of submodular flows
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Biconnectivity approximations and graph carvings
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- A Parallel Repetition Theorem
- Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
- Power consumption in packet radio networks
- Approximating node connectivity problems via set covers
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
- On the hardness of approximating spanners
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
Cited In (26)
- Minimum shared‐power edge cut
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Power Optimization for Connectivity Problems
- Min-power strong connectivity
- On min-power Steiner tree
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Wireless network design via 3-decompositions
- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
- The connected Vietoris powerlocale
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximating activation edge-cover and facility location problems
- Approximating Steiner Networks with Node Weights
- Approximate min-power strong connectivity
- Title not available (Why is that?)
- On Minimum Power Connectivity Problems
- Approximating Minimum-Power Degree and Connectivity Problems
- Approximating minimum-power degree and connectivity problems
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- New results on the complexity of the Max- and Min-Rep problems
- Improved approximation algorithms for minimum power covering problems
- Improved approximation algorithms for label cover problems
- Approximating minimum-power edge-covers and 2,3-connectivity
- Survivable network activation problems
- 1.61-approximation for min-power strong connectivity with two power levels
- Approximating minimum power edge-multi-covers
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 Q877193)
