Abstract
We present a combinatorial primal-dual 7-approximation algorithm for the k-level stochastic facility location problem, the stochastic counterpart of the standard k-level facility location problem. This approximation ratio is slightly worse than that of the primal-dual 6-approximation for the standard k-level facility location problem [3] because of the extra stochastic assumption. This new result complements the recent non-combinatorial 3-approximation algorithm for the same problem by Wang et al [21].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aardal, K.I., Chudak, F., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters 72, 161–167 (1999)
Ageev, A., Ye, Y., Zhang, J.: Improved combinatorial apporximation algorithms for the k-level facility location problem. SIAM Journal on Discrete Mathematics 18(1), 207–217 (2004)
Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Proceedings of APPROX-RANDOM, pp. 55–63 (2001)
Byrka, J., Aardal, K.I.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing (to appear)
Chen, X., Chen, B.: Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica 53(3), 263–297 (2007)
Chudak, F., Shmoys, D.B.: Improved approxiamtion algorithms for the uncapaciteted facility location problem. SIAM Journal on Computing 33(1), 1–25 (2003)
Gabor, A.F., van Ommeren, J.-K.C.W.: A new approximation algorithm for the multilevel facility location problem. Discrete Applied Mathematics 158(5-6), 453–460 (2010)
Guha, S., Khuller, S.: Greedy strike back: Improved facility location algorithms. Journal of Algorithms 31, 228–248 (1999)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithm analyzed using dual fitting with factor-revealing LP. Jounal of the ACM 50, 795–824 (2003)
Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM 48, 274–296 (2001)
Mahdian, M.: Facility location and the analysis of algorithms through factor-revealing programs, Ph. D. thesis, MIT, Cambridge, MA (2004)
Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM Journal on Computing 36(2), 411–432 (2006)
Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithhms for stochastic optimization problems. Mathematical Programming 108, 97–114 (2006)
Schrijver, A.: Combinatorial optimization: Polyhedra and Efficiency. In: Algorithms and Combinatorics, vol. 24(A). Springer, New York (2003)
Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. Journal of the ACM 53, 978–1012 (2006)
Shmoys, D.B., Tardös, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265–274 (1997)
Shu, J.: An efficient greedy heuristic for warehouse-retailer network design optimization. Transportation Science, doi:10.1287/trsc.1090.0302
Shu, J., Ma, Q., Li, S.: Integrated location and two-echelon inventory network design under uncertainty. Annals of Operations Research, doi:10.1007/s10479-010-0732-z
Shu, J., Teo, C.P., Max Shen, Z.J.: Stochastic transportation-inventory network design problem. Operations Research 53, 48–60 (2005)
Srinivasan, A.: Approximation algorithms for stochastic and risk-averse optimization. In: Proceedings of SODA, pp. 1305–1313 (2007)
Wang, Z., Du, D., Gabor, A., Xu, D.: An approximation algorithm for the k-level stochastic facility location problem. Operations Research Letters, doi:10.1016/j.orl.2010.04.010
Ye, Y., Zhang, J.: An approximation algorithm for the dynamic facility location problem. In: Combinatorial Optimization in Communication Networks, pp. 623–637. Kluwer Academic Publishers, Dordrecht (2005)
Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming 108, 159–176 (2006)
Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research 30(2), 389–403 (2005)
Zhang, P.: A new approximation algorithm for the k-facility location problem. Theoretical Computer Science 384(1), 126–135 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Z., Du, D., Xu, D. (2010). A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)