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(√m log m), 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.
|Title of host publication||Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings|
|Editors||Martti Penttonen, Erik Meineche Schmidt|
|Number of pages||10|
|State||Published - 2002|
|Event||8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 - Turku, Finland|
Duration: 3 Jul 2002 → 5 Jul 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||8th Scandinavian Workshop on Algorithm Theory, SWAT 2002|
|Period||3/07/02 → 5/07/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.