Approximating Minimum-Power Degree and Connectivity Problems
From MaRDI portal
Publication:5458548
DOI10.1007/978-3-540-78773-0_37zbMATH Open1136.68331OpenAlexW2109384905MaRDI QIDQ5458548FDOQ5458548
Guy Kortsarz, Elena Tsanko, Zeev Nutov, Vahab S. Mirrokni
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_37
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cited In (10)
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Power Optimization for Connectivity Problems
- Wireless network design via 3-decompositions
- Sum-of-squares lower bounds for densest \(k\)-subgraph
- On Minimum Power Connectivity Problems
- Approximating minimum-power degree and connectivity problems
- On the Power of Nodes of Degree Four in the Local Max-Cut Problem
- Approximating minimum-power edge-covers and 2,3-connectivity
- Approximating minimum power edge-multi-covers
This page was built for publication: Approximating Minimum-Power Degree and Connectivity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458548)
