A probabilistic analysis of the set covering problem
- 1 October 1984
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 1 (3) , 255-271
- https://doi.org/10.1007/bf01874392
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
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972