Covering things with things

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 662-674

  Langerman, Stefan ^a   Morin, Pat ^b  

^a MCGILL UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COVERING PROBLEMS; FIXED-PARAMETER TRACTABLE ALGORITHMS; GEOMETRIC COVERINGS; MONTE CARLO ALGORITHMS; NP-HARD; RUNNING TIME; THREE PARAMETERS; TRACTABLE ALGORITHMS;

PARAMETER ESTIMATION;

EID: 84938061378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_58     Document Type: Conference Paper

References (16)

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. 671
2. George E. Andrews. The Theory of Partitions. Addison-Wesley, 1976. 670
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. 671
4. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280–301, 2001. 663
5. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer, 1999. 662,666
6. Leonhardo Eulero. Introductio in Analysin Infinitorum. Tomus Primus, Lausanne, 1748. 670
7. 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. 671
8. R. Hassin and N. Megiddo. Approximation algorithms for hitting objects by straight lines. Discrete Applied Mathematics, 30:29–42, 1991. 671
9. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer Systems Sciences, 9:256–278, 1974. 673
10. R. M. Karp. Reducibility Among Combinatorial Problems, pages 85–103. Plenum Press, 1972. 672
11. 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. 671, 673
12. N. Megiddo and A. Tamir. On the complexity of locating linear facilities in the plane. Operations Research Letters, 1:194–197, 1982. 662, 671
13. 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. 663
14. Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. 664
15. 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. 663 674
16. 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. 663