A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
β Scribed by Donglei Du; Ruixing Lu; Dachuan Xu
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 360 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating