Min-power strong connectivity

DOI10.1007/978-3-642-15369-3_6MaRDI QIDQ3588400zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu

Publication date 10 September 2010

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15369-3_6

Mathematics Subject Classification ID

Connectivity (05C40) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximate min-power strong connectivity
• 1.61-approximation for min-power strong connectivity with two power levels
• On minimum power connectivity problems
• On Minimum Power Connectivity Problems
• Power optimization for connectivity problems

Cited in

(9)

• The connected Vietoris powerlocale
• Dual power assignment via second Hamiltonian cycle
• Approximate min-power strong connectivity
• Strongly connected spanning subgraph for almost symmetric networks
• Symmetric connectivity with directional antennas
• T-joins in strongly connected hypergraphs
• Bounded-angle spanning tree: modeling networks with angular constraints
• 1.61-approximation for min-power strong connectivity with two power levels
• Minimum shared‐power edge cut

This page was built for publication: Min-power strong connectivity

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