Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.comnet.2004.08.012 | Computer Networks |
Keywords | DocType | Volume |
Wireless networks,Network design,Basestation placement,Disk covering | Journal | 47 |
Issue | ISSN | Citations |
4 | Computer Networks | 40 |
PageRank | References | Authors |
1.68 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nissan Lev-Tov | 1 | 137 | 7.91 |
| David Peleg | 2 | 6662 | 824.19 |