Polynomial time approximation schemes for base station coverage with minimum total radii
- 6 October 2004
- journal article
- Published by Elsevier in Computer Networks
- Vol. 47 (4) , 489-501
- https://doi.org/10.1016/j.comnet.2004.08.012
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Clustering to minimize the sum of cluster diametersPublished by Association for Computing Machinery (ACM) ,2001
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Covering a set of points in multidimensional spaceInformation Processing Letters, 1991
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985