Minimum-cost coverage of point sets by disks
Authors:
Open Access
- 5 June 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 449-458
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Polynomial time approximation schemes for base station coverage with minimum total radiiComputer Networks, 2005
- Polynomial-Time Approximation Schemes for Geometric Intersection GraphsSIAM Journal on Computing, 2005
- Approximation algorithms for TSP with neighborhoods in the planeJournal of Algorithms, 2003
- Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.Computational 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