Login / Signup

Some Further Approximation Algorithms for the Vertex Cover Problem.

Burkhard MonienEwald Speckenmeyer
Published in: CAAP (1983)
Keyphrases
  • vertex cover
  • approximation algorithms
  • np hard
  • special case
  • minimum cost
  • worst case
  • precedence constraints
  • approximation ratio
  • lower bound
  • constant factor
  • undirected graph
  • planar graphs