Approximating Min Sum Set Cover.
Uriel FeigeLászló LovászPrasad TetaliPublished in: Algorithmica (2004)
Keyphrases
- set cover
- min sum
- np hard
- approximation algorithms
- greedy algorithm
- lower bound
- special case
- network flow
- integer programming
- optimal solution
- scheduling problem
- greedy heuristic
- worst case
- computational complexity
- minimum cost
- constraint satisfaction problems
- knapsack problem
- linear program
- multiple objectives
- markov random field
- upper bound
- min cut
- cost function