Login / Signup
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.
Reuven Bar-Yehuda
Danny Hermelin
Dror Rawitz
Published in:
SIAM J. Discret. Math. (2010)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
polynomial time approximation
reinforcement learning
lower bound
dynamic programming
branch and bound algorithm