Approximation Algorithms for the Set Covering and Vertex Cover Problems
- 1 August 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (3), 555-556
- https://doi.org/10.1137/0211045
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- A new algorithm for the maximal flow problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965