Approximating the minimum weight weak vertex cover.
Yong ZhangQi GeRudolf FleischerTao JiangHong ZhuPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- vertex cover
- minimum weight
- planar graphs
- bipartite graph
- spanning tree
- greedy heuristic
- approximation algorithms
- weighted graph
- minimum spanning tree
- precedence constraints
- partial order
- randomized algorithm
- tree patterns
- bayesian networks
- shortest path
- scheduling problem
- dynamic programming
- np hard
- search algorithm