Approximation algorithms for the partial assignment problem.
Guichen GaoLi NingHing-Fung TingYicheng XuYong ZhangYifei ZouPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- np hardness
- set cover
- exact algorithms
- primal dual
- approximation schemes
- network design problem
- integer programming
- disjoint paths
- randomized algorithms
- optimal solution
- knapsack problem
- approximation ratio
- constraint satisfaction problems
- precedence constraints
- undirected graph
- scheduling problem
- lower bound
- open shop
- greedy heuristic
- convex optimization
- learning algorithm