A modified greedy heuristic for the Set Covering problem with improved worst case bound
- 20 December 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 48 (6) , 305-310
- https://doi.org/10.1016/0020-0190(93)90173-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975