{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078431,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_26","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"284-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for the Dynamic k-level Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Limin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"issue":"5\u20136","key":"26_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the $$k$$-level uncapacitated facility location problem. Inf. Process. Lett. 72(5\u20136), 161\u2013167 (1999)","journal-title":"Inf. Process. Lett."},{"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 approximation algorithms for the $$k$$-level facility location problem. SIAM J. Discrete Math. 18(1), 207\u2013217 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44666-4_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"A Bumb","year":"2001","unstructured":"Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM -2001. LNCS, vol. 2129, pp. 55\u201363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44666-4_10"},{"key":"26_CR4","first-page":"119","volume-title":"Discrete Location Theory","author":"G Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119\u2013171. Wiley, New York (1990)"},{"issue":"1","key":"26_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.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"26_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 (JACM) 48(2), 274\u2013296 (2001)","journal-title":"J. ACM (JACM)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229\u2013242. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45753-4_20"},{"key":"26_CR8","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 624\u2013630. IEEE (2000)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Aardal, K.I.: Approximation algorithms for facility location problems, vol. 1997. Utrecht University: Information and Computing Sciences (1997)","DOI":"10.1145\/258533.258600"},{"issue":"10","key":"26_CR10","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1287\/mnsc.28.10.1091","volume":"28","author":"TJ Van Roy","year":"1982","unstructured":"Van Roy, T.J., Erlenkotter, D.: A dual-based procedure for dynamic facility location. Manag. Sci. 28(10), 1091\u20131105 (1982)","journal-title":"Manag. Sci."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-14355-7_26","volume-title":"Algorithmic Aspects in Information and Management","author":"Zhen Wang","year":"2010","unstructured":"Wang, Z., Du, D., Xu, D.: A primal-dual approximation algorithm for the k-level stochastic facility location problem. In: Chen, B. (ed.) AAIM 2010. LNCS, pp. 253\u2013260. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14355-7_26"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D Xu","year":"2006","unstructured":"Xu, D., Du, D.: The k-level facility location game. Oper. Res. Lett. 34(4), 421\u2013426 (2006)","journal-title":"Oper. Res. Lett."},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Ye, Y., Zhang, J.: An approximation algorithm for the dynamic facility location problem. In: Cheng, M.X., Li, Y., Du, D.Z. (eds.) Combinatorial Optimization in Communication Networks, vol. 18, pp. 623\u2013637. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-29026-5_22","DOI":"10.1007\/0-387-29026-5_22"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:17:40Z","timestamp":1709824660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}