Covering things with things

Discrete and Computational Geometry

Volumn 33, Issue 4, 2005, Pages 717-729

  Langerman, Stefan ^a   Morin, Pat ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444388015     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1108-4     Document Type: Article

References (22)

1. P. K. Agarwal and C. M. Procopiuc. Exact and approximation algorithms for clustering. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pages 658-667, 1998.
2. G. E. Andrews. The Theory of Partitions. Addison-Wesley, Reading, MA, 1976.
3. B. Brodén, M. Hammar, and B. J. Nilsson. Guarding lines and 2-link polygons is APX-hard. In Proceedings of the 13th Canadian Conference on Computational Geometry, pages 45-48, 2001.
4. B. Chazelle and J. Matoǔsek. On linear-time deterministic algorithms for optimization problems in fixed dimension. Journal of Algorithms, 21(3):579-597, November 1996.
5. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
7. L. Eulero. Introductio in Analysin Infinitorum. Tomus Primus, Lausanne, 1748.
8. L. J. Guibas, M. H. Overmars, and J.-M. Robert. The exact fitting problem for points. Computational Geometry: Theory and Applications, 6:215-230, 1996.
9. R. Hassin and N. Megiddo. Approximation algorithms for hitting objects by straight lines. Discrete Applied Mathematics, 30:29-42, 1991.
10. D. Haussler and E. Welzl. ε-Nets and simplex range queries. Discrete & Computational Geometry, 2:127-151, 1987.
11. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
12. R. M. Karp. Reducibility Among Combinatorial Problems, pages 85-103. Plenum, New York, 1972.
13. V. S. A. Kumar, S. Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 624-635, 2000.
14. C. Makris and A. Tsakalidis. Fast piercing of iso-oriented rectangles. In Proceedings of the 9th Canadian Conference on Computational Geeometry, pages 217-222, 1997.
15. J. Matoušek. Approximations and optimal geometric divide-and-conquer. Journal of Computer and System Sciences, 50(2):203-208, April 1995.
16. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16:498-516, 1996.
17. N. Megiddo and A. Tamir. On the complexity of locating linear facilities in the plane. Operations Research Letters, 1:194-197, 1982.
18. D. Nussbaum. Rectilinear p-piercing problems. In ISSAC '97. Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, July 21-23, 1997, Maui, Hawaii, pages 316-323, 1997.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
20. M. Segal. On piercing of axis-parallel rectangle and rings. International Journal of Computational Geometry and Applications, 9(3):219-233, 1999.
21. M. Sharir and E. Welzl. Rectilinear and polygonal p-piercing and p-center problems. In Proceedings of the Twelfth Annual Symposium on Computational Geometry (ISG '96), pages 122-132, 1996.
22. V. N. Vapnik and A. Y. A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.