Approximating Minimum-Power Degree and Connectivity Problems
From MaRDI portal
Publication:5458548
DOI10.1007/978-3-540-78773-0_37zbMath1136.68331OpenAlexW2109384905MaRDI QIDQ5458548
Elena Tsanko, Guy Kortsarz, 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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (4)
On minimum power connectivity problems ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Wireless network design via 3-decompositions ⋮ Approximating minimum-power edge-covers and 2,3-connectivity
This page was built for publication: Approximating Minimum-Power Degree and Connectivity Problems
