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