Exact algorithms and approximation schemes for base station placement problems

Nissan Lev-Tov, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsMartti Penttonen, Erik Meineche Schmidt
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540438663
StatePublished - 2002
Externally publishedYes
Event8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 - Turku, Finland
Duration: 3 Jul 20025 Jul 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th Scandinavian Workshop on Algorithm Theory, SWAT 2002

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.


Dive into the research topics of 'Exact algorithms and approximation schemes for base station placement problems'. Together they form a unique fingerprint.

Cite this