{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:34Z","timestamp":1725557974146},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_26","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:34:40Z","timestamp":1277300080000},"page":"253-260","source":"Crossref","is-referenced-by-count":3,"title":["A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K.I. Aardal","year":"1999","unstructured":"Aardal, K.I., Chudak, F., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters\u00a072, 161\u2013167 (1999)","journal-title":"Information Processing Letters"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A. Ageev","year":"2004","unstructured":"Ageev, A., Ye, Y., Zhang, J.: Improved combinatorial apporximation algorithms for the k-level facility location problem. SIAM Journal on Discrete Mathematics\u00a018(1), 207\u2013217 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Proceedings of APPROX-RANDOM, pp. 55\u201363 (2001)","DOI":"10.1007\/3-540-44666-4_10"},{"key":"26_CR4","unstructured":"Byrka, J., Aardal, K.I.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing (to appear)"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-007-9032-7","volume":"53","author":"X. Chen","year":"2007","unstructured":"Chen, X., Chen, B.: Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica\u00a053(3), 263\u2013297 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F. Chudak","year":"2003","unstructured":"Chudak, F., Shmoys, D.B.: Improved approxiamtion algorithms for the uncapaciteted facility location problem. SIAM Journal on Computing\u00a033(1), 1\u201325 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"5-6","key":"26_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.dam.2009.11.007","volume":"158","author":"A.F. Gabor","year":"2010","unstructured":"Gabor, A.F., van Ommeren, J.-K.C.W.: A new approximation algorithm for the multilevel facility location problem. Discrete Applied Mathematics\u00a0158(5-6), 453\u2013460 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strike back: Improved facility location algorithms. Journal of Algorithms\u00a031, 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"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\u00a050, 795\u2013824 (2003)","journal-title":"Jounal of the ACM"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"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\u00a048, 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"26_CR11","unstructured":"Mahdian, M.: Facility location and the analysis of algorithms through factor-revealing programs, Ph. D. thesis, MIT, Cambridge, MA (2004)"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM Journal on Computing\u00a036(2), 411\u2013432 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","volume":"108","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithhms for stochastic optimization problems. Mathematical Programming\u00a0108, 97\u2013114 (2006)","journal-title":"Mathematical Programming"},{"key":"26_CR14","volume-title":"Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization: Polyhedra and Efficiency. In: Algorithms and Combinatorics, vol.\u00a024(A). Springer, New York (2003)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"D.B. Shmoys","year":"2006","unstructured":"Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. Journal of the ACM\u00a053, 978\u20131012 (2006)","journal-title":"Journal of the ACM"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tard\u00f6s, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Shu, J.: An efficient greedy heuristic for warehouse-retailer network design optimization. Transportation Science, doi:10.1287\/trsc.1090.0302","DOI":"10.1287\/trsc.1090.0302"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/s10479-010-0732-z"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.1040.0140","volume":"53","author":"J. Shu","year":"2005","unstructured":"Shu, J., Teo, C.P., Max Shen, Z.J.: Stochastic transportation-inventory network design problem. Operations Research\u00a053, 48\u201360 (2005)","journal-title":"Operations Research"},{"key":"26_CR20","unstructured":"Srinivasan, A.: Approximation algorithms for stochastic and risk-averse optimization. In: Proceedings of SODA, pp. 1305\u20131313 (2007)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1016\/j.orl.2010.04.010"},{"key":"26_CR22","first-page":"623","volume-title":"Combinatorial Optimization in Communication Networks","author":"Y. Ye","year":"2005","unstructured":"Ye, Y., Zhang, J.: An approximation algorithm for the dynamic facility location problem. In: Combinatorial Optimization in Communication Networks, pp. 623\u2013637. Kluwer Academic Publishers, Dordrecht (2005)"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J. Zhang","year":"2006","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming\u00a0108, 159\u2013176 (2006)","journal-title":"Mathematical Programming"},{"issue":"2","key":"26_CR24","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J. Zhang","year":"2005","unstructured":"Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research\u00a030(2), 389\u2013403 (2005)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2007.05.024","volume":"384","author":"P. Zhang","year":"2007","unstructured":"Zhang, P.: A new approximation algorithm for the k-facility location problem. Theoretical Computer Science\u00a0384(1), 126\u2013135 (2007)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:25:11Z","timestamp":1619785511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}