Combinatorial approximation algorithms for buy-at-bulk connected facility location problems.
Andreas BleyMohsen RezapourPublished in: Discret. Appl. Math. (2016)
Keyphrases
- approximation algorithms
- facility location problem
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- primal dual
- constant factor
- set cover
- open shop
- randomized algorithms
- network design problem
- approximation ratio
- polynomial time approximation
- upper bound
- disjoint paths
- evolutionary algorithm
- facility location
- approximation guarantees
- integer programming
- constant factor approximation