Combining Two Worlds: Parameterised Approximation for Vertex Cover.

Ljiljana Brankovic Henning Fernau

Published in: ISAAC (1) (2010)

Keyphrases

vertex cover
approximation algorithms
polynomial time approximation
np hard
worst case
approximation ratio
special case
minimum cost
precedence constraints
error bounds
partial order
planar graphs
optimality criterion
graph cuts
undirected graph
constant factor