Combinatorial approximation algorithms for the robust facility location problem with penalties.
Fengmin WangDachuan XuChenchen WuPublished in: J. Glob. Optim. (2016)
Keyphrases
- facility location problem
- approximation algorithms
- dominating set
- np hard
- special case
- worst case
- vertex cover
- open shop
- minimum cost
- set cover
- network design problem
- constant factor
- randomized algorithms
- facility location
- primal dual
- combinatorial auctions
- disjoint paths
- constant factor approximation
- learning algorithm
- lower bound