{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:17Z","timestamp":1759637597517,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T00:00:00Z","timestamp":1552953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2018YFF0213304"],"award-info":[{"award-number":["2018YFF0213304"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Higher Educational Science and Technology Program of Shandong Province","award":["J17KA171"],"award-info":[{"award-number":["J17KA171"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433012","U1435215"],"award-info":[{"award-number":["61433012","U1435215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501412","11531014"],"award-info":[{"award-number":["11501412","11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10878-019-00404-2","type":"journal-article","created":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T03:03:30Z","timestamp":1552964610000},"page":"618-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation algorithm for squared metric two-stage stochastic facility location problem"],"prefix":"10.1007","volume":"38","author":[{"given":"Jin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"issue":"1","key":"404_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/15M1043790","volume":"32","author":"J Byrka","year":"2018","unstructured":"Byrka J, Srinivasan A (2018) Approximation algorithms for stochastic and risk-averse optimization. SIAM J Discrete Math 32(1):44\u201363","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"404_CR2","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar M, Guha S (2005) Improved combinatorial algorithms for facility location problems. SIAM J Comput 34(4):803\u2013824","journal-title":"SIAM J Comput"},{"issue":"1","key":"404_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33(1):1\u201325","journal-title":"SIAM J Comput"},{"issue":"2","key":"404_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10107-014-0821-x","volume":"153","author":"CG Fernandes","year":"2015","unstructured":"Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC (2015) A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math Program 153(2):655\u2013685","journal-title":"Math Program"},{"issue":"1","key":"404_CR5","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 (1999) Greedy strikes back: Improved facility location algorithms. J Algorithms 31(1):228\u2013248","journal-title":"J Algorithms"},{"issue":"2","key":"404_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48(2):274\u2013296","journal-title":"J ACM"},{"issue":"6","key":"404_CR7","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 VV (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50(6):795\u2013824","journal-title":"J ACM"},{"issue":"1","key":"404_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu MR, Plaxton CG, Rajaraman R (2000) Analysis of a local search heuristic for facility location problems. J Algorithms 37(1):146\u2013188","journal-title":"J Algorithms"},{"key":"404_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li S (2013) A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45\u201358","journal-title":"Inf Comput"},{"issue":"1","key":"404_CR10","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 (2006) Hedging uncertainty: approximation algorithms for stochastic optimization problems. Math Program 108(1):97\u2013114","journal-title":"Math Program"},{"issue":"3","key":"404_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s40305-013-0020-0","volume":"1","author":"J Shao","year":"2013","unstructured":"Shao J, Xu D (2013) An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties. J Oper Res Soc China 1(3):339\u2013346","journal-title":"J Oper Res Soc China"},{"key":"404_CR12","unstructured":"Shmoys DB, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of the 29th annual ACM symposium on theory of computing, pp 265\u2013274"},{"key":"404_CR13","doi-asserted-by":"crossref","unstructured":"Sviridenko M (2002) An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 9th international conference on integer programming and combinatorial optimization, pp 240\u2013257","DOI":"10.1007\/3-540-47867-1_18"},{"key":"404_CR14","unstructured":"Swamy C (2004) Approximation algorithms for clustering problems. Ph.D. thesis. Cornell University"},{"issue":"4","key":"404_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s40305-013-0034-7","volume":"1","author":"C Wu","year":"2013","unstructured":"Wu C, Xu D, Shu J (2013) An approximation algorithm for the stochastic fault-tolerant facility location problem. J Oper Res Soc China 1(4):511\u2013522","journal-title":"J Oper Res Soc China"},{"issue":"1","key":"404_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11425-014-4933-9","volume":"58","author":"C Wu","year":"2015","unstructured":"Wu C, Du D, Xu D (2015) An improved per-scenario bound for the two-stage stochastic facility location problem. Sci China Math 58(1):213\u2013220","journal-title":"Sci China Math"},{"key":"404_CR17","first-page":"623","volume-title":"An approximation algorithm for the dynamic facility location problem. In: Combinatorial optimization in communication networks","author":"Y Ye","year":"2006","unstructured":"Ye Y, Zhang J (2006) An approximation algorithm for the dynamic facility location problem. In: Combinatorial optimization in communication networks. Springer, Boston, MA, pp 623\u2013637"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00404-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00404-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00404-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:05:22Z","timestamp":1584489922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00404-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,19]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["404"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00404-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,3,19]]},"assertion":[{"value":"19 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}