A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.
Reuven Bar-YehudaShimon EvenPublished in: J. Algorithms (1981)
Keyphrases
- vertex cover
- learning algorithm
- worst case
- np hard
- polynomial time approximation
- optimal solution
- dynamic programming
- simulated annealing
- theoretical analysis
- approximation algorithms
- probabilistic model
- error bounds
- approximation ratio
- expectation maximization
- planar graphs
- undirected graph
- knapsack problem
- single machine
- search space
- objective function
- bayesian networks