On the Approximate Compressibility of Connected Vertex Cover.

Diptapriyo Majumdar M. S. Ramanujan Saket Saurabh

Published in: CoRR (2019)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
special case
optimality criterion
bayesian networks
precedence constraints
computational complexity
np hard