Online Learning for Min Sum Set Cover and Pandora's Box.
Evangelia GergatsouliChristos TzamosPublished in: CoRR (2022)
Keyphrases
- set cover
- online learning
- min sum
- s box
- np hard
- approximation algorithms
- special case
- greedy algorithm
- lower bound
- scheduling problem
- e learning
- linear programming
- worst case
- greedy heuristic
- network flow
- initial conditions
- integer programming
- minimum cost
- active learning
- optimal solution
- constraint satisfaction problems
- linear program
- computational complexity
- knapsack problem
- efficient implementation
- goal programming
- solution space
- min cut
- global optimization
- convex hull
- dynamic programming
- similarity measure