Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties.
Gaidi LiDachuan XuDonglei DuChenchen WuPublished in: FAW (2015)
Keyphrases
- facility location problem
- approximation algorithms
- submodular functions
- constant factor approximation
- np hard
- dominating set
- vertex cover
- special case
- worst case
- minimum cost
- greedy algorithm
- set cover
- network design problem
- primal dual
- constant factor
- approximation ratio
- objective function
- randomized algorithms
- open shop
- linear programming
- disjoint paths
- combinatorial auctions
- integer programming
- upper bound
- evolutionary algorithm
- optimal solution