A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem.
Teofilo F. GonzalezPublished in: Inf. Process. Lett. (1995)
Keyphrases
- vertex cover
- approximation algorithms
- minimum weight
- optimal solution
- np hard
- polynomial time approximation
- linear programming
- learning algorithm
- error bounds
- worst case
- minimum spanning tree
- approximation ratio
- dynamic programming
- combinatorial optimization
- simulated annealing
- expectation maximization
- segmentation algorithm
- search space
- greedy heuristic
- randomized algorithm
- computational complexity
- probabilistic model