Approximation Algorithm for N-distance Minimal Vertex Cover Problem.

Tarun Yadav Koustav Sadhukhan Arvind Mallari Rao

Published in: CoRR (2016)

Keyphrases

vertex cover
approximation algorithms
computational complexity
dynamic programming
learning algorithm
worst case
np hard
theoretical analysis
closed form
optimal solution
special case
polynomial time approximation
probabilistic model
energy function
log likelihood
approximation ratio