{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:17Z","timestamp":1759637957499,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T00:00:00Z","timestamp":1495584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["283106"],"award-info":[{"award-number":["283106"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11590-017-1153-6","type":"journal-article","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T07:59:45Z","timestamp":1495612785000},"page":"561-571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An approximation algorithm for the dynamic facility location problem with outliers"],"prefix":"10.1007","volume":"13","author":[{"given":"Yanjun","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"issue":"2","key":"1153_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"K Aardal","year":"2015","unstructured":"Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated $$k$$ k -facility location problems. Eur. J. Oper. Res. 242(2), 358\u2013368 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1153_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 algorithm for the $$k$$ k -level facility location problem. SIAM J. Discrete Math. 18(1), 207\u2013217 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"1153_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J., Rybicki, B., Uniyal, S.: An approximation algorithm for uniform capacitated $$k$$ k -median problem with $$1 + \\epsilon $$ 1 + \u03f5 capacity violation. In: Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (2016)","DOI":"10.1007\/978-3-319-33461-5_22"},{"key":"1153_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-007-9032-7","volume":"53","author":"X Chen","year":"2009","unstructured":"Chen, X., Chen, B.: Approximation algorithm for soft-capacitated facility location in capacitated network design. Algorithmica 53, 263\u2013297 (2009)","journal-title":"Algorithmica"},{"key":"1153_CR5","unstructured":"Charikar M., Khuller S., Mount D.M., Narasimhan G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 642\u2013651 (2001)"},{"key":"1153_CR6","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location. SIAM J. Comput. 34, 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1153_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F Chudak","year":"2003","unstructured":"Chudak, F., Shmoys, D.: Improved approximation algorithm for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"1153_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63, 191\u2013200 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"1153_CR9","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"},{"key":"1153_CR10","unstructured":"Hamilton M.M.: Loud and Clear, a Silent E. Washington Post. 23, (2000)"},{"key":"1153_CR11","volume-title":"Approximation Algorithms for NP-hard Problems","author":"D Hochbaum","year":"1997","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"1153_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and $$k$$ k -median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"1153_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A Kuehn","year":"1963","unstructured":"Kuehn, A., Hamburger, M.: A heuristic program for locating warehouses. Manag. Sci. 9, 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"issue":"1","key":"1153_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"key":"1153_CR15","doi-asserted-by":"crossref","unstructured":"Li, S.: A $$1.488$$ 1.488 -approximation algorithm for the uncapacitated facility location problem. In: Proceedings of the 38th International Colloquim Conference on Automata, Languages and Programming, Part 2. pp. 77\u201388 (2011)","DOI":"10.1007\/978-3-642-22012-8_5"},{"key":"1153_CR16","volume-title":"Facilities Location: Models and Methods","author":"R Love","year":"1988","unstructured":"Love, R., Morris, J., Wesolowsky, G.: Facilities Location: Models and Methods. North-Holland, New York (1988)"},{"issue":"2","key":"1153_CR17","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 algorithm for metric facility location problem. SIAM J. Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"key":"1153_CR18","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), LNCS 2462, pp. 229\u2013242. Springer-Verlag, New York (2002)","DOI":"10.1007\/3-540-45753-4_20"},{"key":"1153_CR19","doi-asserted-by":"crossref","unstructured":"Qiu, L., Padmanabhan, V., Voelker, G.: On the placement of web server replicas. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a03, pp. 1587\u20131596 (2001)","DOI":"10.1109\/INFCOM.2001.916655"},{"key":"1153_CR20","unstructured":"Sviridenko M.: Cited as personal communication in Chudak and Shmoys [7] (1998)"},{"key":"1153_CR21","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tard\u00f6s, \u00c9., Aardal, K.: Approximation algorithm for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"10","key":"1153_CR22","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1287\/mnsc.28.10.1091","volume":"28","author":"TJ Roy Van","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":"1153_CR23","doi-asserted-by":"crossref","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, pp. 623\u2013637. Springer, US (2006)","DOI":"10.1007\/0-387-29026-5_22"},{"key":"1153_CR24","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$$ k -facility location problem. Theor. Comput. Sci. 384, 126\u2013135 (2007)","journal-title":"Theor. Comput. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1153-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:39:41Z","timestamp":1750275581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1153-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,24]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["1153"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1153-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,5,24]]},"assertion":[{"value":"16 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}