An approximation algorithm for the partial vertex cover problem in hypergraphs.
Mourad El OualiHelena FohlinAnand SrivastavPublished in: J. Comb. Optim. (2016)
Keyphrases
- vertex cover
- learning algorithm
- dynamic programming
- error bounds
- polynomial time approximation
- knapsack problem
- np hard
- reinforcement learning
- constant factor
- combinatorial optimization
- search space
- computational complexity
- sequential patterns
- theoretical analysis
- worst case
- bin packing
- optimal solution
- objective function