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