Some further approximation algorithms for the vertex cover problem
Authors:
- 1 January 1983
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 341-349
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Girth and Independence RatioCanadian Mathematical Bulletin, 1982
- On approximating a vertex cover for planar graphs1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973