Approximation algorithms for the partition vertex cover problem.

Suman Kalyan Bera Shalmoli Gupta Amit Kumar Sambuddha Roy

Published in: Theor. Comput. Sci. (2014)

Keyphrases

vertex cover
approximation algorithms
special case
np hard
worst case
minimum cost
primal dual
approximation ratio
precedence constraints
constant factor
polynomial time approximation
knapsack problem
undirected graph