Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty.
Yu LiDonglei DuNaihua XiuDachuan XuPublished in: COCOON (2013)
Keyphrases
- approximation algorithms
- facility location problem
- submodular functions
- np hard
- constant factor approximation
- special case
- vertex cover
- minimum cost
- worst case
- network design problem
- set cover
- objective function
- open shop
- primal dual
- lower bound
- greedy algorithm
- constant factor
- approximation ratio
- randomized algorithms
- linear constraints
- integer programming