1.61-approximation for min-power strong connectivity with two power levels

DOI10.1007/s10878-014-9738-9zbMath1341.90133OpenAlexW2004706672MaRDI QIDQ5963620

Gruia Călinescu

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9738-9

zbMATH Keywords

approximation algorithmmatroid matchingpower assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Approximation algorithm for receiver interference problem in dual power wireless sensor networks ⋮ Parameterized complexity of min-power asymmetric connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Power assignment in radio networks with two power levels
• Wireless network design via 3-decompositions
• Matching theory
• On the graphic matroid parity problem
• On strongly connected digraphs with bounded cycle length
• Energy-efficient wireless network design
• Approximate Min-Power Strong Connectivity
• On Min-Power Steiner Tree
• Faster Algebraic Algorithms for Path and Packing Problems
• Min-Power Strong Connectivity
• Color-coding
• Approximating the Minimum Equivalent Digraph
• Algorithms - ESA 2003

This page was built for publication: 1.61-approximation for min-power strong connectivity with two power levels