A simple local 3-approximation algorithm for vertex cover.
Valentin PolishchukJukka SuomelaPublished in: Inf. Process. Lett. (2009)
Keyphrases
- vertex cover
- approximation algorithms
- np hard
- dynamic programming
- learning algorithm
- polynomial time approximation
- theoretical analysis
- optimal solution
- closed form
- objective function
- approximation ratio
- expectation maximization
- worst case
- simulated annealing
- greedy algorithm
- probabilistic model
- log likelihood
- search space
- lower bound
- search algorithm