The Price of Connectivity for Vertex Cover.

Eglantine Camby Jean Cardinal Samuel Fiorini Oliver Schaudt

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

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
connected components
optimality criterion
polynomial time approximation
maximum likelihood
log likelihood
np hard