Sign in
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal.
Konrad K. Dabrowski
Matthew Johnson
Giacomo Paesani
Daniël Paulusma
Viktor Zamaraev
Published in:
MFCS (2018)
Keyphrases
</>
vertex cover
vertex set
approximation algorithms
undirected graph
partial order
precedence constraints
planar graphs
weighted graph
np hard
scheduling problem
optimality criterion
special case
polynomial time approximation
minimum cost