A modification of the greedy algorithm for vertex cover
- 1 January 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (1) , 23-25
- https://doi.org/10.1016/0020-0190(83)90007-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- 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