Login / Signup

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.

Reuven Bar-YehudaDanny HermelinDror Rawitz
Published in: WAOA (2009)
Keyphrases
  • vertex cover
  • approximation algorithms
  • precedence constraints
  • partial order
  • planar graphs
  • optimality criterion
  • scheduling problem
  • special case
  • polynomial time approximation
  • search algorithm
  • np hard