On the Approximability of Multistage Min-Sum Set Cover.
Dimitris FotakisPanagiotis KostopanagiotisVasileios NakosGeorgios PiliourasStratis SkoulakisPublished in: ICALP (2021)
Keyphrases
- set cover
- multistage
- min sum
- np hard
- approximation algorithms
- lower bound
- special case
- scheduling problem
- minimum cost
- single stage
- stochastic programming
- worst case
- integer programming
- dynamic programming
- optimal solution
- knapsack problem
- primal dual
- greedy heuristic
- optimal policy
- linear programming
- lot sizing
- computational complexity
- greedy algorithm
- network flow
- linear program
- upper bound
- solution space
- image processing
- goal programming
- reinforcement learning