Login / Signup
A Local 2-Approximation Algorithm for the Vertex Cover Problem.
Matti Åstrand
Patrik Floréen
Valentin Polishchuk
Joel Rybicki
Jukka Suomela
Jara Uitto
Published in:
DISC (2009)
Keyphrases
</>
vertex cover
dynamic programming
np hard
theoretical analysis
optimal solution
approximation algorithms
learning algorithm
computational complexity
polynomial time approximation
objective function
search space
worst case
error bounds
partial order
approximation ratio
expectation maximization