A Tight Analysis of the Greedy Algorithm for Set Cover

Journal of Algorithms

Volumn 25, Issue 2, 1997, Pages 237-254

  Slavík, Petr ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000489883     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0887     Document Type: Article

References (12)

1. V. Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res. 4 (1979), 233-235.
2. P. Crescenzi and V. Kann, "A Compendium of NP Optimization Problems," Techical Report SI/RR-95/02, Department of Computer Science, University of Rome "La Sapienza," 1995.
3. U. Feige, A thereshold of 1n n for the approximating set cover, in, Proceedings of the ACM Symposium on Theory of Computing, 1996," pp. 314-318.
4. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
5. M. M. Halldórsson, Approximating discrete collections via local improvements, in, "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995."
6. M. M. Halldórsson, "Approximating Set Cover via Local Improvements," JAIST Technical Report IS-RR-95-0002F, 1995.
7. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974), 256-278.
8. R. M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), pp. 85-103, Plenum, New York, 1972.
9. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
10. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach. 41 (1994), 960-981.
11. P. Slavík, "Improved Performance of the Greedy Algorithm for Minimum Set Cover and Minimum Partial Cover," Technical Report 95-45, Department of Computer Science, State University of New York, Buffalo, 1995.
12. A. Srinivasan, Improved Approximation of Packing and Covering Problems, in "Proceedings of the Symposium of Theory of Computing, 1995," pp. 268-276.