Approximation algorithms for connected facility location problems.
Mohammad Khairul HasanHyunwoo JungKyung-Yong ChwaPublished in: J. Comb. Optim. (2008)
Keyphrases
- approximation algorithms
- facility location problem
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- primal dual
- network design problem
- approximation ratio
- constant factor
- set cover
- disjoint paths
- connected components
- randomized algorithms
- polynomial time approximation
- open shop
- graphical models
- scheduling problem