A note on LP-based approximation algorithms for capacitated facility location problem.
Runjie MiaoJinjiang YuanPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- approximation algorithms
- np hard
- primal dual
- linear programming
- quadratic program
- special case
- linear program
- vertex cover
- minimum cost
- single source
- worst case
- network design problem
- facility location problem
- set cover
- optimal solution
- np hardness
- approximation ratio
- constant factor
- undirected graph
- randomized algorithms
- open shop
- approximation schemes
- precedence constraints
- integrality gap
- valid inequalities
- approximation guarantees
- integer programming
- knapsack problem
- search space
- lower bound
- search algorithm