Mean analysis of an online algorithm for the vertex cover problem.

Etienne Birmelé François Delbot Christian Laforest

Published in: Inf. Process. Lett. (2009)

Keyphrases

vertex cover
learning algorithm
computational complexity
objective function
search space
dynamic programming
bin packing
worst case
polynomial time approximation
optimal solution
error bounds
log likelihood
optimality criterion