Polynomial-time approximation schemes for packing and piercing fat objects
- 28 February 2003
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 46 (2), 178-189
- https://doi.org/10.1016/s0196-6774(02)00294-8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Dynamic data structures for fat objects and their applicationsComputational Geometry, 2000
- Label placement by maximum independent set in rectanglesComputational Geometry, 1998
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Approximate Nearest Neighbor Queries RevisitedDiscrete & Computational Geometry, 1998
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Approximate closest-point queries in high dimensionsInformation Processing Letters, 1993
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981