Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms

Volumn 46, Issue 2, 2003, Pages 178-189

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Computational geometry; Dynamic programming; Hitting set; Maximum independent set; Quadtrees; Separator theorems

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; PACKING; PIERCING;

APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME APPROXIMATION SCHEMES (PATS);

POLYNOMIAL APPROXIMATION;

EID: 0038341773     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00294-8     Document Type: Article

References (30)

1. P.K. Agarwal, M. van Kreveld, S. Suri, Label placement by maximum independent set in rectangles, Comput. Geom. Theory Appl. 11 (1998) 209-218.
2. P.K. Agarwal, M. Sharir, Efficient algorithms for geometric optimization, ACM Comput. Surveys 30 (1998) 412-458.
3. S. Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, J. ACM 45 (1998) 753-782.
4. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, A. Wu, An optimal algorithm for approximate nearest neighbor searching, J. ACM 45 (1998) 891-923.
5. B.S.Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
6. M. de Berg, M. Katz, A.F. van der Stappen, J. Vleugels, Realistic input models for geometric algorithms, in: Proc. 13th ACM Sympos. Comput. Geom., 1997, pp. 294-303.
7. P. Berman, B. DasGupta, S. Muthukrishnan, S. Ramaswami, Improved approximation algorithms for rectangle tiling and packing, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 427-436.
8. M. Bern, Approximate closest-point queries in high dimensions, Inform. Process. Lett. 45 (1993) 95-99.
9. T.M. Chan, Approximate nearest neighbor queries revisited, Discrete Comput. Geom. 20 (1998) 359-373.
10. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
11. A. Efrat, M.J. Katz, F. Nielsen, M. Sharir, Dynamic data structures for fat objects and their applications, Comput. Geom. Theory Appl. 15 (2000) 215-227.
12. T. Erlebach, K. Jansen, E. Seidel, Polynomial-time approximation schemes for geometric graphs, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 671-679.
13. U. Feige, A threshold of Inn for approximating set cover, J. ACM 45 (1998) 634-652.
14. R.J. Fowler, M.S. Paterson, S.L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett. 12 (1981) 133-137.
15. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman. New York, 1979.
16. 1-ε, Acta Math. 182 (1999) 105-142.
17. D.S. Hochbaum, W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM 32 (1985) 130-136.
18. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, R.E. Stearns, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, J. Algorithms 26 (1998) 238-274.
19. H. Imai, T. Asano, Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, J. Algorithms 4 (1983) 310-323.
20. M. van Kreveld, T. Strijk, A. Wolff, Point set labeling with sliding labels, in: Proc. 14th ACM Sympos. Comput. Geom., 1998, pp. 337-346.
21. S. Khanna, S. Muthukrishnan, M. Paterson, On approximating rectangle tiling and packing, in: Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1998, pp. 384-393.
22. R.J. Lipton, R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 32 (1979) 177-189.
23. R.J. Lipton, R.E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980) 615-627.
24. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995) 59-68.
25. G.L. Miller, S.-H. Teng, W. Thurston, S.A. Vavasis, Separators for sphere-packings and nearest neighbor graphs, J. ACM 44 (1997) 1-29.
26. F. Nielsen, Fast stabbing of boxes in high dimensions, Theoret. Comput. Sci. 246 (2000) 53-72.
27. J. Pach, P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
28. S.B. Rao, W.D. Smith, Improved approximation schemes for geometrical graphs via 'Spanners' and 'Banyans', in: Proc. 31st ACM Sympos. Theory Comput., 1999, pp. 540-550.
29. P. Slavík, A tight analysis of the greedy algorithm for set cover, in: Proc. 28th ACM Sympos. Theory Comput., 1996, pp. 435-439.
30. W.D. Smith, N.C. Wormald, Geometric separator theorems and applications, in: Proc. 39th IEEE Sympos. Found. Comput. Sci., 1998, pp. 232-243.