{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:16:52Z","timestamp":1742977012416,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_42","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"538-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Approximation Algorithm for\u00a0Squared Metric k-Facility Location"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2974-5781","authenticated-orcid":false,"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal-dual algorithms. SIAM J. Comput. 49(4), FOCS17:97\u2013FOCS17:156 (2020)","DOI":"10.1137\/18M1171321"},{"issue":"2","key":"42_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"42_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1027\u20131035 (2007)"},{"issue":"3","key":"42_CR4","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$$-median and facility location problems. SIAM J. Comput. 33(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"ID Baev","year":"2008","unstructured":"Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput. 38(4), 1411\u20131429 (2008)","journal-title":"SIAM J. Comput."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median and positive correlation in budgeted optimization. ACM Trans. Algor. 13(2), 23:1\u201323:31 (2017)","DOI":"10.1145\/2981561"},{"key":"42_CR7","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 (SODA), pp. 642\u2013651 (2001)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., Li, S.: A dependent LP-rounding approach for the $$k$$-median problem. In: Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 194\u2013205 (2012)","DOI":"10.1007\/978-3-642-31594-7_17"},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for $$k$$-means and $$k$$-median in Euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"42_CR10","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1016\/j.cie.2010.09.012","volume":"59","author":"T Cura","year":"2010","unstructured":"Cura, T.: A parallel local search approach to solving the uncapacitated warehouse location problem. Comput. Ind. Eng. 59(4), 1000\u20131009 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Feng, Q., Zhang, Z., Shi, F., Wang, J.: An improved approximation algorithm for the $$k$$-means problem with penalties. In: Proceedings of the 13th International Workshop on Frontiers in Algorithmics (FAW), pp. 170\u2013181 (2019)","DOI":"10.1007\/978-3-030-18126-0_15"},{"issue":"2","key":"42_CR12","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.A., Miyazawa, F.K., Pedrosa, L.L.C.: 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 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/17M1127181","volume":"48","author":"Z Friggstad","year":"2019","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for $$k$$-means in doubling metrics. SIAM J. Comput. 48(2), 452\u2013480 (2019)","journal-title":"SIAM J. Comput."},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. ACM Trans. Algor. 5(4), 34:1\u201334:26 (2009)","DOI":"10.1145\/1597036.1597037"},{"issue":"1","key":"42_CR15","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. Algor. 31(1), 228\u2013248 (1999)","journal-title":"J. Algor."},{"key":"42_CR16","unstructured":"Gupta, A., Guruganesh, G., Schmidt, M.: Approximation algorithms for aversion $$k$$-clustering via local $$k$$-median. In: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), pp. 1\u201313 (2016)"},{"key":"42_CR17","unstructured":"Gupta, A., Tangwongsan, K.: Simpler analyses of local search algorithms for facility location. CoRR abs\/0809.2554 (2008)"},{"issue":"4","key":"42_CR18","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00453-011-9547-9","volume":"63","author":"M Hajiaghayi","year":"2012","unstructured":"Hajiaghayi, M., Khandekar, R., Kortsarz, G.: Local search algorithms for the red-blue median problem. Algorithmica 63(4), 795\u2013814 (2012)","journal-title":"Algorithmica"},{"key":"42_CR19","unstructured":"Hayrapetyan, A., Swamy, C., Tardos, \u00c9.: Network design for information networks. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 933\u2013942 (2005)"},{"issue":"6","key":"42_CR20","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, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"42_CR21","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(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T Kanungo","year":"2004","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A local search approximation algorithm for $$k$$-means clustering. Comput. Geom. 28, 89\u2013112 (2004)","journal-title":"Comput. Geom."},{"issue":"2","key":"42_CR23","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. SIAM J. Comput. 45(2), 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"42_CR24","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157(3), 576\u2013591 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"42_CR25","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1109\/TNET.2015.2480093","volume":"24","author":"S Wang","year":"2016","unstructured":"Wang, S., Bi, J., Wu, J., Vasilakos, A.V.: CPHR: In-network caching for information-centric networking with partitioning and hash-routing. IEEE\/ACM Trans. Netw. 24(5), 2742\u20132755 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"42_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2018.02.026","volume":"749","author":"C Wu","year":"2018","unstructured":"Wu, C., Du, D., Xu, D.: An approximation algorithm for the $$k$$-median problem with uniform penalties via pseudo-solution. Theor. Comput. Sci. 749, 80\u201392 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"42_CR27","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1007\/s10878-018-0261-2","volume":"35","author":"D Zhang","year":"2018","unstructured":"Zhang, D., Xu, D., Wang, Y., Zhang, P., Zhang, Z.: A local search approximation algorithm for a squared metric $$k$$-facility location problem. J. Comb. Optim. 35(4), 1168\u20131184 (2018)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"42_CR28","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$$-facility location problem. Theor. Comput. Sci. 384(1), 126\u2013135 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR29","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.neucom.2021.04.028","volume":"450","author":"Z Zhang","year":"2021","unstructured":"Zhang, Z., Feng, Q., Huang, J., Guo, Y., Xu, J., Wang, J.: A local search algorithm for $$k$$-means with outliers. Neurocomputing 450, 230\u2013241 (2021)","journal-title":"Neurocomputing"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Feng, Q., Xu, J., Wang, J.: An approximation algorithm for $$k$$-median with priorities. Sci. China Inf. Sci. 64(5), 150104 (2021)","DOI":"10.1007\/s11432-020-3066-x"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:57Z","timestamp":1639354137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}