Exact algorithms and approximation schemes for base station placement problems

Nissan Lev-Tov; David Peleg

doi:10.1007/3-540-45471-3_10

Exact algorithms and approximation schemes for base station placement problems

Nissan Lev-Tov
, David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

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 2^O(^√^{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 language	English
Title of host publication	Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings
Editors	Martti Penttonen, Erik Meineche Schmidt
Publisher	Springer Verlag
Pages	90-99
Number of pages	10
ISBN (Print)	9783540438663
DOIs	https://doi.org/10.1007/3-540-45471-3_10
State	Published - 2002
Externally published	Yes
Event	8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 - Turku, Finland Duration: 3 Jul 2002 → 5 Jul 2002

Publication series

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

Conference

Conference	8th Scandinavian Workshop on Algorithm Theory, SWAT 2002
Country/Territory	Finland
City	Turku
Period	3/07/02 → 5/07/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Access to Document

10.1007/3-540-45471-3_10

Cite this

Lev-Tov, N., & Peleg, D. (2002). Exact algorithms and approximation schemes for base station placement problems. In M. Penttonen, & E. M. Schmidt (Eds.), Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings (pp. 90-99). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2368). Springer Verlag. https://doi.org/10.1007/3-540-45471-3_10

Lev-Tov, Nissan ; Peleg, David. / Exact algorithms and approximation schemes for base station placement problems. Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. editor / Martti Penttonen ; Erik Meineche Schmidt. Springer Verlag, 2002. pp. 90-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4fb0c7b5591b4bdebfed7264a4c9b943,

title = "Exact algorithms and approximation schemes for base station placement problems",

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(√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.",

author = "Nissan Lev-Tov and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 ; Conference date: 03-07-2002 Through 05-07-2002",

year = "2002",

doi = "10.1007/3-540-45471-3\_10",

language = "אנגלית",

isbn = "9783540438663",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "90--99",

editor = "Martti Penttonen and Schmidt, \{Erik Meineche\}",

booktitle = "Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "גרמניה",

}

Lev-Tov, N & Peleg, D 2002, Exact algorithms and approximation schemes for base station placement problems. in M Penttonen & EM Schmidt (eds), Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2368, Springer Verlag, pp. 90-99, 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, Turku, Finland, 3/07/02. https://doi.org/10.1007/3-540-45471-3_10

Exact algorithms and approximation schemes for base station placement problems. / Lev-Tov, Nissan; Peleg, David.
Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. ed. / Martti Penttonen; Erik Meineche Schmidt. Springer Verlag, 2002. p. 90-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2368).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Exact algorithms and approximation schemes for base station placement problems

AU - Lev-Tov, Nissan

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84943239716

U2 - 10.1007/3-540-45471-3_10

DO - 10.1007/3-540-45471-3_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84943239716

SN - 9783540438663

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 90

EP - 99

BT - Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Penttonen, Martti

A2 - Schmidt, Erik Meineche

PB - Springer Verlag

T2 - 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002

Y2 - 3 July 2002 through 5 July 2002

ER -

Lev-Tov N, Peleg D. Exact algorithms and approximation schemes for base station placement problems. In Penttonen M, Schmidt EM, editors, Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. Springer Verlag. 2002. p. 90-99. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45471-3_10

Exact algorithms and approximation schemes for base station placement problems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this