Minimum-cost coverage of point sets by disks
- 5 June 2006
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 449-458
- https://doi.org/10.1145/1137856.1137922
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Polynomial-Time Approximation Schemes for Geometric Intersection GraphsSIAM Journal on Computing, 2005
- Polynomial time approximation schemes for base station coverage with minimum total radiiComputer Networks, 2004
- Approximation algorithms for TSP with neighborhoods in the planePublished by Elsevier ,2003
- Approximation algorithms for lawn mowing and millingComputational Geometry, 2000
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- Approximation algorithms for the geometric covering salesman problemDiscrete Applied Mathematics, 1994
- Minimizing the sum of diameters efficientlyComputational Geometry, 1992
- Covering a set of points in multidimensional spaceInformation Processing Letters, 1991
- Proving geometric algorithm non-solvability: An application of factoring polynomialsJournal of Symbolic Computation, 1986
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985