An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs.
Yong ZhangHong ZhuPublished in: COCOON (2004)
Keyphrases
- vertex cover
- approximation algorithms
- undirected graph
- polynomial time approximation
- dynamic programming
- approximation ratio
- np hard
- expectation maximization
- search space
- special case
- em algorithm
- graph structure
- error bounds
- closed form
- linear programming
- optimal solution
- directed graph
- bayesian framework
- objective function
- minimum cost
- probabilistic model
- lower bound
- computational complexity