Wireless network design via 3-decompositions

DOI10.1016/j.ipl.2009.07.013zbMath1206.68040OpenAlexW2020164139MaRDI QIDQ990943

Ariel Yaroshevitch, Zeev Nutov

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.013

zbMATH Keywords

approximation algorithmsSteiner treeswireless networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (8)

Improved approximation algorithms for single-tiered relay placement ⋮ Approximating Steiner Trees and Forests with Minimum Number of Steiner Points ⋮ Dual power assignment via second Hamiltonian cycle ⋮ Combination algorithms for Steiner tree variants ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ Approximating Steiner trees and forests with minimum number of Steiner points ⋮ Approximating Survivable Networks with Minimum Number of Steiner Points ⋮ Relay placement for two-connectivity

Cites Work

• Power optimization for connectivity problems
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
• Low-degree minimum spanning trees
• An 11/6-approximation algorithm for the network Steiner problem
• A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• Approximating Minimum-Power Degree and Connectivity Problems
• Algorithms - ESA 2003
• Approximations for Steiner trees with minimum number of Steiner points

This page was built for publication: Wireless network design via 3-decompositions