Approximating the piercing number for unit-height rectangles

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 15-18

  Chan, Timothy M ^a   Mahmood, Abdullah Al ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PIERCING; POLYNOMIAL APPROXIMATION;

AMORTIZED TIME; DYNAMIC SETTINGS; INTERVAL GRAPH; MAXIMUM INDEPENDENT SETS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

COMPUTATIONAL GEOMETRY;

EID: 84863404066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Maintaining information in fully-dynamic trees with top trees, http://arxiv.org/abs/cs/0310065, 2003.
2. T. M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms, 46:178-189, 2003.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
4. A. Efrat, M. J. Katz, F. Nielsen, and M. Sharir. Dynamic data structures for fat objects and their applications. Computational Geometry: Theory and Applications, 15(4):215-227, April 2000.
5. T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 434-444, 1988.
6. R. J. Fowler, M. S. Paterson, and S. L. Tani-moto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12(3):133-137, June 1981.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, 1979.
8. T. F. Gonzalez. Covering a set of points in multidimensional space. Information Processing Letters, 40:181-188, November 1991.
9. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32(1):130-136, January 1985.
10. M. J. Katz, F. Nielsen, and M. Segal. Maintenance of a piercing set for intervals with applications. Al-gorithmica, 36(l):59-73, February 2003.
11. S. Langerman. On the shooter location problem: Maintaining dynamic circular-arc graphs. In Proceedings of the 12th Canadian Conference on Computational Geometry, 2000.
12. E, M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257-276, May 1985.
13. F. Nielsen. Fast stabbing of boxes in high dimensions. Theoretical Computer Science, 246:53-72, 2000.