{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:46Z","timestamp":1740122386271,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Doctoral Fund of Shandong Jianzhu University","award":["XNBS1264"],"award-info":[{"award-number":["XNBS1264"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081","61433012"],"award-info":[{"award-number":["11871081","61433012"]}],"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":["61672323"],"award-info":[{"award-number":["61672323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Excellent Talents Funding","award":["2014000020124G046"],"award-info":[{"award-number":["2014000020124G046"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10898-018-00733-2","type":"journal-article","created":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T05:28:32Z","timestamp":1546493312000},"page":"909-932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Local search approximation algorithms for the sum of squares facility location problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Dongmei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"key":"733_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for $$k$$ k -median and facility location problems. SIAM J. Comput. 33, 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"unstructured":"Bandyapadhyay, S., Varadarajan, K.: On variants of $$k$$ k -means clustering. In: Proceedings of SoCG 2016, Article No. 14, pp. 14:1\u201314:15","key":"733_CR2"},{"doi-asserted-by":"crossref","unstructured":"Chalupa, D., Nielsen, P.: Instance scale, numerical properties and design of metaheuristics: a study for the facility location problem. ArXiv preprint arXiv:1801.03419 (2018)","key":"733_CR3","DOI":"10.1016\/j.ifacol.2019.11.535"},{"unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and $$k$$ k -median problems. In: Proceedings of FOCS, pp. 378\u2013388 (1999)","key":"733_CR4"},{"key":"733_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10107-014-0821-x","volume":"153","author":"CG Fernandes","year":"2015","unstructured":"Fernandes, C.G., Meira, L.A., Miyazawa, F.K., Pedrosa, L.L.: A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153, 655\u2013685 (2015)","journal-title":"Math. Program."},{"key":"733_CR6","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, 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"733_CR7","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$$ k -median problems using the primal\u2013dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"733_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"2","author":"T Kanungoa","year":"2004","unstructured":"Kanungoa, T., Mountb, D.M., Netanyahuc, N.S., Piatkoe, C.D., Silvermand, R., Wu, A.Y.: A local search approximation algorithm for $$k$$ k -means clustering. Comput. Geom. Theory Appl. 2, 89\u2013112 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"733_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.: A $$1.488$$ 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222, 45\u201358 (2013)","journal-title":"Inf. Comput."},{"key":"733_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar $$k$$ k -means problem is NP-hard. Theor. Comput. Sci. 442, 13\u201321 (2012)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Makarychev, K., Makarychev, Y., Sviridenko, M., Ward, J.: A bi-criteria approximation algorithm for $$k$$ k -means. In: Proceedings of APPROX\/RONDOM\u201916, Article No. 14, pp. 14:1\u201314:20","key":"733_CR11"},{"key":"733_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J Matou\u0161ek","year":"2000","unstructured":"Matou\u0161ek, J.: On approximate geometric $$k$$ k -clustering. Discrete Comput. Geom. 24, 61\u201384 (2000)","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos,\u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265\u2013274 (1997)","key":"733_CR13","DOI":"10.1145\/258533.258600"},{"unstructured":"Ward, J.: Private Communication (2017)","key":"733_CR14"},{"key":"733_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"doi-asserted-by":"crossref","unstructured":"Zhang, D., Hao, C., Wu, C., Xu, D., Zhang, Z.: A local search approximation algorithm for the $$k$$ k -means problem with penalties. In: Proceedings of COCOON, pp. 568\u2013574 (2017)","key":"733_CR16","DOI":"10.1007\/978-3-319-62389-4_47"},{"key":"733_CR17","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":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-00733-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-00733-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-00733-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T16:29:37Z","timestamp":1662740977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-00733-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["733"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-00733-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"30 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}