Approximation algorithms for k-median with lower-bound constraints.
Ameet GadekarBruno OrdozgoitiSuhas ThejaswiPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- worst case
- constant factor approximation
- constant factor
- lower and upper bounds
- upper bound
- randomized algorithms
- special case
- branch and bound algorithm
- vertex cover
- precedence constraints
- facility location problem
- set cover
- primal dual
- optimal solution
- minimum cost
- approximation ratio
- approximation schemes
- objective function
- integrality gap
- open shop
- branch and bound
- network design problem
- strongly np hard
- np hardness
- scheduling problem
- linear program
- linear programming
- constraint programming
- average case
- global constraints
- approximation guarantees
- computational complexity
- integer programming