Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.
Eunpyeong HongMong-Jen KaoPublished in: ISAAC (2018)
Keyphrases
- vertex cover
- approximation algorithms
- dynamic programming
- theoretical analysis
- polynomial time approximation
- learning algorithm
- np hard
- linear programming
- computational complexity
- linear program
- optimal solution
- closed form
- approximation ratio
- objective function
- bayesian networks
- search space
- worst case
- expectation maximization
- sequential patterns
- combinatorial optimization
- error bounds
- knapsack problem