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