Polynomial time approximation schemes for base station coverage with minimum total radii

Nissan Lev-Tov; David Peleg

doi:10.1016/j.comnet.2004.08.012

Polynomial time approximation schemes for base station coverage with minimum total radii

Nissan Lev-Tov, David Peleg

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

82 Scopus citations

Abstract

This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.

Original language	English
Pages (from-to)	489-501
Number of pages	13
Journal	Computer Networks
Volume	47
Issue number	4
DOIs	https://doi.org/10.1016/j.comnet.2004.08.012
State	Published - 15 Mar 2005
Externally published	Yes

Bibliographical note

Funding Information:
Supported in part by a grant from the Israel Ministry of Industry and Commerce.

Funding

Supported in part by a grant from the Israel Ministry of Industry and Commerce.

Funders	Funder number
Israel Ministry of Industry and Commerce

Keywords

Basestation placement
Disk covering
Network design
Wireless networks

Access to Document

10.1016/j.comnet.2004.08.012

Cite this

@article{78dfcd0fea8c48918c761b7cf43786b1,

title = "Polynomial time approximation schemes for base station coverage with minimum total radii",

abstract = "This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.",

keywords = "Basestation placement, Disk covering, Network design, Wireless networks",

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

note = "Funding Information: Supported in part by a grant from the Israel Ministry of Industry and Commerce. ",

year = "2005",

month = mar,

day = "15",

doi = "10.1016/j.comnet.2004.08.012",

language = "אנגלית",

volume = "47",

pages = "489--501",

journal = "Computer Networks",

issn = "1389-1286",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Polynomial time approximation schemes for base station coverage with minimum total radii

AU - Lev-Tov, Nissan

AU - Peleg, David

N1 - Funding Information: Supported in part by a grant from the Israel Ministry of Industry and Commerce.

PY - 2005/3/15

Y1 - 2005/3/15

N2 - This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.

AB - This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.

KW - Basestation placement

KW - Disk covering

KW - Network design

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=13844276646&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2004.08.012

DO - 10.1016/j.comnet.2004.08.012

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:13844276646

SN - 1389-1286

VL - 47

SP - 489

EP - 501

JO - Computer Networks

JF - Computer Networks

IS - 4

ER -

Polynomial time approximation schemes for base station coverage with minimum total radii

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this