Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.
Eunpyeong HungMong-Jen KaoPublished in: Algorithmica (2022)
Keyphrases
- vertex cover
- approximation algorithms
- planar graphs
- dynamic programming
- polynomial time approximation
- learning algorithm
- computational complexity
- approximation ratio
- linear programming
- theoretical analysis
- em algorithm
- minimum spanning tree
- graph structure
- closed form
- expectation maximization
- special case
- search space
- lower bound
- objective function