Exact Algorithms and Approximation Schemes for Base Station Placement Problems

Authors:
Nissan Lev-Tov;David Peleg
Affiliations:
-;-
Venue:
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Year:
2002

Citing 5
Cited 4

Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Clustering to minimize the sum of cluster diameters

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

Journal of Algorithms
Combination can be hard: approximability of the unique coverage problem

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating geometric coverage problems

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Reducing power consumption of mobile access networks with cooperation

Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns geometric disk problems motivated by base station placement problems arising in wireless network design. We first study problems that involve maximizing the coverage under various interference-avoidance constraints. A representative problem for this type is the maximum weight independent set problem on unit disk graphs, for which we present an exact solution whose complexity is exponential but with a sublinear exponent. Specifically, our algorithm has time complexity 2O(驴mlogm), where m is the number of disks. We then study the problem of covering all the clients by a collection of disks of variable radii while minimizing the sum of radii, and present a PTAS for this problem.