On Min Sum Vertex Cover and Generalized Min Sum Set Cover.
Nikhil BansalJatin BatraMajid FarhadiPrasad TetaliPublished in: SIAM J. Comput. (2023)
Keyphrases
- min sum
- set cover
- approximation algorithms
- np hard
- vertex cover
- special case
- lower bound
- scheduling problem
- minimum cost
- optimal solution
- worst case
- integer programming
- linear programming
- greedy heuristic
- computational complexity
- knapsack problem
- primal dual
- linear program
- constraint satisfaction problems
- branch and bound algorithm
- goal programming
- greedy algorithm
- tabu search
- feasible solution
- objective function