Login / Signup
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:
CoRR (2019)
Keyphrases
</>
vertex cover
vertex set
approximation algorithms
undirected graph
planar graphs
partial order
precedence constraints
weighted graph
random graphs
optimality criterion
np hard
computational complexity
special case
branch and bound algorithm
log likelihood
polynomial time approximation