Wireless network design via 3-decompositions

DOI10.1016/J.IPL.2009.07.013MaRDI QIDQ990943zbMATH OpenOpenAlexFDO

Authors Zeev Nutov, Ariel Yaroshevitch

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 algorithmswireless networksSteiner trees

Mathematics Subject Classification ID

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

Recommendations

• Towards an accurate solution of wireless network design problems
• Network design under general wireless interference
• Wireless network optimization by Perron-Frobenius theory
• The three-node wireless network: achievable rates and Cooperation strategies
• Approximation schemes for wireless networks
• Optimization decomposition in energy-constrained wireless networks
• On the wireless local area network design problem with performance guarantees
• Survivable network design problems in wireless networks

Cites work

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

Cited in

(10)

• 1.61-approximation for min-power strong connectivity with two power levels
• Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach
• Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
• Improved approximation algorithms for single-tiered relay placement
• Approximating Steiner trees and forests with minimum number of Steiner points
• Approximating Steiner trees and forests with minimum number of Steiner points
• Relay placement for two-connectivity
• Soft computing methods for WiMAX network planning on 3D geographical information systems
• Dual power assignment via second Hamiltonian cycle
• Combination algorithms for Steiner tree variants

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

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