Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.

Bart M. P. Jansen

Published in: STACS (2016)

Keyphrases

vertex cover
approximation algorithms
planar graphs
worst case
precedence constraints
partial order
lower bound
upper bound
support vector
polynomial time approximation
bipartite graph
optimality criterion
special case
undirected graph
feature space
model selection
greedy algorithm
finding optimal
search algorithm