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

Computer Networks

Volumn 47, Issue 4, 2005, Pages 489-501

  Lev Tov, Nissan ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Basestation placement; Disk covering; Network design; Wireless networks

Indexed keywords

ALGORITHMS; NONLINEAR SYSTEMS; PROBLEM SOLVING; SERVERS; TELECOMMUNICATION NETWORKS; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

BASESTATION PLACEMENT; DISK COVERING; NETWORK DESIGN; WIRELESS NETWORKS;

POLYNOMIAL APPROXIMATION;

EID: 13844276646     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2004.08.012     Document Type: Article

References (8)

1. H. Bronnimann, and M.T. Goodrich Almost optimal set covers in finite vc-dimension Discrete Computational Geometry 14 1995 463 479
2. M. Charikar, R. Panigary, Clustering to minimize the sum of cluster diameters, in: Proc. 33rd ACM Symp. on Theory of Computing, July 2001
3. A.E.F Clementi, P. Penna, R. Silvestri, On the power assignment problem in radio networks, Technical Report TR00-054, Electronic Colloquium on Computational Complexity, 2000
4. T. Erlebach, K. Jansen, E. Seidel, Polynomial-time approximation schemes for geometric graphs, in: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, 2001
5. T. Gonzalez Covering a set of points in multidimensional space Information Processing Letters 40 1991 181 188
6. C. Glasser, S. Reith, and H. Vollmer The complexity of base station positioning in cellular networks Proc. ICALP Workshops 2000 Carleton Press 167 177
7. D.S. Hochbaum, and W. Maas Approximation schemes for covering and packing problems in image processing and VLSI Journal of the ACM 32 1985 130 136
8. K. Pahlavan, and A. Levesque Wireless Information Networks 1995 Wiley-Interscience New York