Vertex Cover in Graphs with Locally Few Colors.

Fabian Kuhn Monaldo Mastrolilli

Published in: ICALP (1) (2011)

Keyphrases

vertex cover
planar graphs
approximation algorithms
partial order
undirected graph
precedence constraints
graph theory
optimality criterion
directed graph
weighted graph
pairwise
np hard
worst case
spanning tree
polynomial time approximation