Approximating vertex cover using edge-based representations.

Thomas Jansen Pietro S. Oliveto Christine Zarges

Published in: FOGA (2013)

Keyphrases

vertex cover
approximation algorithms
precedence constraints
partial order
planar graphs
scheduling problem
optimality criterion
image segmentation
objective function
random variables
polynomial time approximation