{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:01:39Z","timestamp":1743080499750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_31","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"341-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Local Search Approximation Algorithms for the Spherical k-Means Problem"],"prefix":"10.1007","author":[{"given":"Dongmei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"31_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. In: Proceedings of FOCS, pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"key":"31_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, 245\u2013249 (2009)","journal-title":"Mach. Learn."},{"key":"31_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of SODA, pp. 1027\u20131035 (2007)"},{"key":"31_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, 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"key":"31_CR5","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. Algorithms 13(2) (2017). Article No. 23","DOI":"10.1145\/2981561"},{"key":"31_CR6","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and $$k$$-median problems. In: Proceedings of FOCS, pp. 378\u2013388 (1999)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, $$\\acute{\\rm E}$$., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem. J. Comput. Syst. Sci. 65, 129\u2013149 (2002)","DOI":"10.1006\/jcss.2002.1882"},{"key":"31_CR8","unstructured":"Cohen-Addad, V., Mathieu, C.: Effectiveness of local search for geometric optimization. In: Proceedings of SoCG, pp. 329\u2013343 (2015)"},{"key":"31_CR9","doi-asserted-by":"crossref","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. In: Proceedings of FOCS, pp. 353\u2013364 (2016)","DOI":"10.1109\/FOCS.2016.46"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Schwiegelshohn, C.: On the local structure of stable clustering instances. In: Proceedings of FOCS, pp. 49\u201360 (2017)","DOI":"10.1109\/FOCS.2017.14"},{"key":"31_CR11","unstructured":"Dasgupta, S.: The hardness of $$k$$-means clustering. Technical report CS2007-0890, University of California, San Diego (2007)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1007612920971","volume":"42","author":"IS Dhillon","year":"2001","unstructured":"Dhillon, I.S., Modha, D.S.: Concept decompositions for large sparse text data using clustering. Mach. Learn. 42, 143\u2013175 (2001)","journal-title":"Mach. Learn."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Endo, Y., Miyamoto, S.: Spherical $$k$$-means$$++$$ clustering. In: Proceedings of MDAI, pp. 103\u2013114 (2015)","DOI":"10.1007\/978-3-319-23240-9_9"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for $$k$$-means in doubling metrics. In: Proceedings of FOCS, pp. 365\u2013374 (2016)","DOI":"10.1109\/FOCS.2016.47"},{"key":"31_CR15","unstructured":"Friggstad, Z., Zhang, Y.: Tight analysis of a multiple-swap heurstic for budgeted red-blue median. In: Proceedings of ICALP, pp. 75:1\u201375:13 (2016)"},{"issue":"10","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v050.i10","volume":"50","author":"K Hornik","year":"2012","unstructured":"Hornik, K., Feinerer, I., Kober, M., Buchta, C.: Spherical $$k$$-means clustering. J. Stat. Softw. 50(10), 1\u201322 (2012)","journal-title":"J. Stat. Softw."},{"key":"31_CR17","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":"31_CR18","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. Theory Appl. 28, 89\u2013112 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR19","doi-asserted-by":"publisher","unstructured":"Li, M., Xu, D., Zhang, D., Zou, J.: The seeding algorithms for spherical $$k$$-means clustering. J. Glob. Optim. 1\u201314 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00779-w","DOI":"10.1007\/s10898-019-00779-w"},{"key":"31_CR20","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, 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"key":"31_CR21","unstructured":"Lloyd, S.: Least squares quantization in PCM. Technical report, Bell Laboratories (1957)"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28, 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan K.: The planar $$k$$-means problem is NP-hard. In: Proceedings of WALCOM, pp. 274\u2013285 (2009)","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Makarychev, Y., Sviridenko, M., Ward, J.: A bi-criteria approximation algorithm for $$k$$-means. In: Proceedings of APPROX\/RONDOM, pp. 14:1\u201314:20 (2016). Article No. 14","DOI":"10.19086\/da.876"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Matou$$\\check{\\rm s}$$ek, J.: On approximate geometric $$k$$-clustering. Discrete Comput. Geom. 24, 61\u201384 (2000)","DOI":"10.1007\/s004540010019"},{"key":"31_CR26","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, 126\u2013135 (2007)","journal-title":"Theor. Comput. Sci."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:18:21Z","timestamp":1709824701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_31","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"}}]}}