{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:56:19Z","timestamp":1757620579572,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_3","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:16Z","timestamp":1753979116000},"page":"32-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Per-Scenario Bound for\u00a0the\u00a0Two-Stage Stochastic Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Mengzhen","family":"Li","sequence":"first","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"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"6","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J Byrka","year":"2010","unstructured":"Byrka, J.: Aardal, K: an optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6), 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/15M1043790","volume":"32","author":"J Byrka","year":"2018","unstructured":"Byrka, J., Srinivasan, A.: Approximation algorithms for stochastic and risk-averse optimization. SIAM J. Discret. Math. 32(1), 44\u201363 (2018)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01651330","volume":"22","author":"CM Fortuin","year":"1971","unstructured":"Fortuin, C.M., Kasteleyn, P.W., Ginibre, J.: Correlation inequalities on some partially ordered sets. Commun. Math. Phys. 22, 89\u2013103 (1971)","journal-title":"Commun. Math. Phys."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/moor.1060.0237","volume":"32","author":"A Gupta","year":"2007","unstructured":"Gupta, A., Ravi, R., Sinha, A.: LP rounding approximation algorithms for stochastic network design. Math. Oper. Res. 32(2), 345\u2013364 (2007)","journal-title":"Math. Oper. Res."},{"key":"3_CR6","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. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th annual ACM Symposium on Theory of Computing, pp. 731-740. (2002)","DOI":"10.1145\/509907.510012"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Li, S.: A $$1.488$$ approximation algorithm for the uncapacitated facility location problem. Inform. Comput. 222, 45-58 (2013)","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"3_CR9","unstructured":"Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. Ph.D. thesis, MIT, Cambridge, MA (2004)"},{"issue":"2","key":"3_CR10","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 J. Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"key":"3_CR11","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 algorithms for stochastic optimization problems. Math. Program. 108, 97\u2013114 (2006)","journal-title":"Math. Program."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, $$\\acute{\\rm E}$$., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265-274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"3_CR13","unstructured":"Srinivasan, A.: Approximation algorithms for stochastic and risk-averse optimization. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1305-1313 (2007)"},{"key":"3_CR14","unstructured":"Swamy, C.: Approximation Algorithms for Clustering Problems. Ph.D. thesis. Cornell University, Ithaca, NY (2004)"},{"key":"3_CR15","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.: An improved per-scenario bound for the two-stage stochastic facility location problem. SCIENCE CHINA Math. 58, 213\u2013220 (2015)","journal-title":"SCIENCE CHINA Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:18:31Z","timestamp":1757323111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}