Polynomial-time approximation schemes for packing and piercing fat objects
References (30)
- et al.
Label placement by maximum independent set in rectangles
Comput. Geom. Theory Appl.
(1998) Approximate closest-point queries in high dimensions
Inform. Process. Lett.
(1993)- et al.
Dynamic data structures for fat objects and their applications
Comput. Geom. Theory Appl.
(2000) - et al.
Optimal packing and covering in the plane are NP-complete
Inform. Process. Lett.
(1981) - et al.
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
J. Algorithms
(1998) - et al.
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
J. Algorithms
(1983) Fast stabbing of boxes in high dimensions
Theoret. Comput. Sci.
(2000)- et al.
Efficient algorithms for geometric optimization
ACM Comput. Surveys
(1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
J. ACM
(1998)- et al.
An optimal algorithm for approximate nearest neighbor searching
J. ACM
(1998)
Approximation algorithms for NP-complete problems on planar graphs
J. ACM
(1994)
Realistic input models for geometric algorithms
Improved approximation algorithms for rectangle tiling and packing
Approximate nearest neighbor queries revisited
Discrete Comput. Geom.
(1998)
Introduction to Algorithms
(1990)
Cited by (0)
- 1
Work supported in part by an NSERC Research Grant.
Copyright © 2003 Elsevier Science (USA). All rights reserved.