On hard instances of approximate vertex cover.

Sundar Vishwanathan

Published in: ACM Trans. Algorithms (2008)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
training set
piecewise linear
polynomial time approximation