Wireless network design via 3-decompositions
type: Item
instance of: scholarly article
title: Wireless network design via 3-decompositions
zbMATH Open document ID: 1206.68040
author: Zeev Nutov
author: Ariel Yaroshevitch
published in: Information Processing Letters
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5777502
zbMATH Keywords: wireless networks
zbMATH Keywords: Steiner trees
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.07.013
OpenAlex ID: W2020164139
cites work: Algorithms - ESA 2003
cites work: Approximations for Steiner trees with minimum number of Steiner points
cites work: Power optimization for connectivity problems
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: Approximating Minimum-Power Degree and Connectivity Problems
cites work: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
cites work: Low-degree minimum spanning trees
cites work: An 11/6-approximation algorithm for the network Steiner problem
DOI: 10.1016/J.IPL.2009.07.013
Recommended article: Towards an Accurate Solution of Wireless Network Design Problems
Recommended article: Network design under general wireless interference
Recommended article: Wireless network optimization by Perron-Frobenius theory
Recommended article: The three-node wireless network: achievable rates and Cooperation strategies
Recommended article: Approximation schemes for wireless networks
Recommended article: Optimization decomposition in energy-constrained wireless networks
Recommended article: On the wireless local area network design problem with performance guarantees
Recommended article: Q5365097
description: scientific article; zbMATH DE number 5777502