An approximation algorithm for the k-level stochastic facility location problem
Redirect to publisher's version
(publisher's version.url.txt, 43 bytes)
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.