Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover.
Nikhil BansalJatin BatraMajid FarhadiPrasad TetaliPublished in: SODA (2021)
Keyphrases
- min sum
- set cover
- np hard
- approximation algorithms
- vertex cover
- minimum cost
- lower bound
- special case
- worst case
- scheduling problem
- branch and bound algorithm
- optimal solution
- linear programming
- primal dual
- knapsack problem
- linear program
- constraint satisfaction problems
- greedy heuristic
- computational complexity
- genetic algorithm
- integer programming
- network flow
- upper bound
- undirected graph