A Tight Analysis of the Greedy Algorithm for Set Cover
- 30 November 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 25 (2), 237-254
- https://doi.org/10.1006/jagm.1997.0887
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Improved approximations of packing and covering problemsPublished by Association for Computing Machinery (ACM) ,1995
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974