Divide-and-Conquer Approximation Algorithm for Vertex Cover.

Eyjolfur Ingi Asgeirsson Cliff Stein

Published in: SIAM J. Discret. Math. (2009)

Keyphrases

vertex cover
approximation algorithms
approximation ratio
dynamic programming
learning algorithm
polynomial time approximation
computational complexity
search space
worst case
image segmentation
np hard
upper bound
error bounds