Equivalent approximation algorithms for node cover

This publication has 8 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• A modification of the greedy algorithm for vertex cover
  Information Processing Letters, 1983
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
  SIAM Journal on Computing, 1982
• Depth-first search and the vertex cover problem
  Information Processing Letters, 1982
• A linear-time approximation algorithm for the weighted vertex cover problem
  Journal of Algorithms, 1981
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• Vertex packings: Structural properties and algorithms
  Mathematical Programming, 1975