Regular ArticleA Tight Analysis of the Greedy Algorithm for Set Cover☆
References (13)
Approximation algorithms for combinatorial problems
J. Comput. System Sci.
(1974)On the ratio of optimal integral and fractional covers
Discrete Math.
(1975)A greedy heuristic for the set-covering problem
Math. Oper. Res.
(1979)- P. Crescenzi, V. Kann, 1995, A Compendium of NP Optimization Problems, Department of Computer Science, University of...
- U. Feige, A thereshold of lnn, Proceedings of the ACM Symposium on Theory of Computing, 1996, 314,...
- et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979)
There are more references available in the full text version of this article.
Cited by (136)
On the explanatory power of Boolean decision trees
2022, Data and Knowledge EngineeringApproximating activation edge-cover and facility location problems
2022, Theoretical Computer ScienceRobust Bidirectional Poly-Matching
2023, IEEE Transactions on Knowledge and Data Engineering
- ☆
R. E. MillerJ. W. Thatcher, Eds.
- *
E-mail: [email protected].
Copyright © 1997 Academic Press. All rights reserved.