Wireless network design via 3-decompositions

Authors:
Zeev Nutov;Ariel Yaroshevitch
Affiliations:
The Open University of Israel, Computer Science, 108 Ravutski street, Raanana, Israel;The Open University of Israel, Computer Science, 108 Ravutski street, Raanana, Israel
Venue:
Information Processing Letters
Year:
2009

Citing 10
Cited 5

A nearly best-possible approximation algorithm for node-weighted Steiner trees

Journal of Algorithms
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3

Journal of Algorithms
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

Information Processing Letters
Approximations for Steiner trees with minimum number of Steiner points

Theoretical Computer Science
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications
Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks

Wireless Networks
Approximating the minimum number of maximum power users in ad hoc networks

Mobile Networks and Applications
Power optimization for connectivity problems

Mathematical Programming: Series A and B
Approximating minimum-power degree and connectivity problems

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Min-power strong connectivity

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating survivable networks with minimum number of Steiner points

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Relay placement for two-connectivity

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Approximating survivable networks with minimum number of steiner points

Networks
On min-power steiner tree

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider some network design problems with applications for wireless networks. The input for these problems is a metric space (X,d) and a finite subset U@?X of terminals. In the Steiner Tree with Minimum Number of Steiner Points (STMSP) problem, the goal is to find a minimum size set S@?X-U of points so that the unit-disc graph of S+U is connected. Let @D be the smallest integer so that for any finite V@?X for which the unit-disc graph is connected, this graph contains a spanning tree with maximum degree =