Approximation Algorithms for the Partition Vertex Cover Problem.

Suman Kalyan Bera Shalmoli Gupta Amit Kumar Sambuddha Roy

Published in: WALCOM (2013)

Keyphrases

vertex cover
approximation algorithms
special case
np hard
worst case
primal dual
minimum cost
precedence constraints
constant factor
polynomial time approximation
reinforcement learning
optimal solution
scheduling problem