A simple local 3-approximation algorithm for vertex cover
Valentin PolishchukJukka SuomelaPublished in: CoRR (2008)
Keyphrases
- vertex cover
- approximation algorithms
- polynomial time approximation
- learning algorithm
- approximation ratio
- optimal solution
- computational complexity
- np hard
- dynamic programming
- closed form
- theoretical analysis
- randomized algorithm
- minimum spanning tree
- worst case
- search space
- objective function
- directed graph
- error bounds
- simulated annealing
- greedy heuristic
- special case
- constant factor
- bayesian networks