Login / Signup
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs.
Fabián A. Chudak
Michel X. Goemans
Dorit S. Hochbaum
David P. Williamson
Published in:
Oper. Res. Lett. (1998)
Keyphrases
</>
approximation algorithms
undirected graph
primal dual
vertex set
special case
minimum cost
np hard
worst case
set cover
algorithm for linear programming
approximation ratio
random graphs
valid inequalities
constant factor
disjoint paths
linear program
search algorithm