{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:05:57Z","timestamp":1750478757415,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_47","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"568-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Local Search Approximation Algorithm for the k-means Problem with Penalties"],"prefix":"10.1007","author":[{"given":"Dongmei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunlin","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","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":[[2017,7,1]]},"reference":[{"key":"47_CR1","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":"47_CR2","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":"47_CR3","unstructured":"Bandyapadhyay, S., Varadarajan, K.: On variants of $$k$$-means clustering. In: Proceedings of SoCG, Article No. 14, pp. 14:1\u201314:15 (2016)"},{"key":"47_CR4","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. In: Proceedings of SODA, pp. 737\u2013756 (2014)","DOI":"10.1137\/1.9781611973730.50"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and $$k$$-median problems. In: Proceedings of FOCS, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"47_CR6","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. In: Proceedings of STOC, pp. 1\u201310 (1999)","DOI":"10.1145\/301250.301257"},{"key":"47_CR7","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp. 642\u2013651 (2001)"},{"key":"47_CR8","unstructured":"Dasgupta, S. The hardness of $$k$$-means clustering. Technical Report CS2007-0890, University of California, San Diego (2007)"},{"key":"47_CR9","unstructured":"Georgogiannis, A.: Robust $$k$$-means: a theoretical revisit. In: Proceedings of NIPS, pp. 2883\u20132891 (2016)"},{"key":"47_CR10","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":"47_CR11","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y Li","year":"2015","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear\/submodular penalties. Algorithmica 73, 460\u2013482 (2015)","journal-title":"Algorithmica"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. In: Proceedings of STOC, pp. 901\u2013910 (2013)","DOI":"10.1145\/2488608.2488723"},{"key":"47_CR13","unstructured":"Lloyd, S.: Least squares quantization in PCM. Technical report, Bell Laboratories (1957)"},{"key":"47_CR14","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":"47_CR15","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":"47_CR16","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, Article No. 14, pp. 14:1\u201314:20 (2016)","DOI":"10.19086\/da.876"},{"key":"47_CR17","doi-asserted-by":"publisher","first-page":"2247","DOI":"10.1093\/bioinformatics\/btm320","volume":"23","author":"GC Tseng","year":"2007","unstructured":"Tseng, G.C.: Penalized and weighted $$k$$-means for clustering with scattered objects and prior information in high-throughput biological data. Bioinformatics 23, 2247\u20132255 (2007)","journal-title":"Bioinformatics"},{"key":"47_CR18","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$$-clustering. Discrete Comput. Geom. 24, 61\u201384 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"47_CR19","unstructured":"Ward, J. Private Communication (2017)"},{"key":"47_CR20","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. Theoret. Comput. Sci. 384, 126\u2013135 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:20:25Z","timestamp":1750447225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}