{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:46:15Z","timestamp":1774446375742,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030181253","type":"print"},{"value":"9783030181260","type":"electronic"}],"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-18126-0_15","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"170-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An Improved Approximation Algorithm for the k-Means Problem with Penalties"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"key":"15_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 58th IEEE Symposium on Foundations of Computer Science, pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"issue":"2","key":"15_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":"15_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035 (2007)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2981561","volume":"13","author":"J Byrka","year":"2017","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), 23 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR5","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"15_CR6","unstructured":"Chen, K.: A constant factor approximation algorithm for $$k$$-median clustering with outliers. In: Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 826\u2013835 (2008)"},{"key":"15_CR7","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 57th IEEE Symposium on Foundations of Computer Science, pp. 353\u2013364 (2016)","DOI":"10.1109\/FOCS.2016.46"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, D., Schulman, L.J.: Data reduction for weighted and outlier-resistant clustering. In: Proceedings of 23st ACM-SIAM Symposium on Discrete Algorithms, pp. 1343\u20131354 (2012)","DOI":"10.1137\/1.9781611973099.106"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Khodamoradi, K., Rezapour, M., Salavatipour, M.R.: Approximation schemes for clustering with outliers. In: Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms, pp. 398\u2013414 (2018)","DOI":"10.1137\/1.9781611975031.27"},{"key":"15_CR10","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 57th IEEE Symposium on Foundations of Computer Science, pp. 365\u2013374 (2016)","DOI":"10.1109\/FOCS.2016.47"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Guha, S., Li, Y., Zhang, Q.: Distributed partial clustering. In: Proceedings of 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 143\u2013152 (2017)","DOI":"10.1145\/3087556.3087568"},{"key":"15_CR12","unstructured":"Gupta, A., Guruganesh, G., Schmidt, M.: Approximation algorithms for aversion $$k$$-clustering via local $$k$$-median. In: Proceedings of 43rd International Colloquium on Automata, Languages and Programming, pp. 1\u201313 (2016)"},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"757","DOI":"10.14778\/3067421.3067425","volume":"10","author":"S Gupta","year":"2017","unstructured":"Gupta, S., Kumar, R., Lu, K., Moseley, B., Vassilvitskii, S.: Local search methods for $$k$$-means with outliers. Proc. VLDB Endow. 10(7), 757\u2013768 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"15_CR14","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":"15_CR15","doi-asserted-by":"crossref","unstructured":"Huang, L., Jiang, S., Li, J., Wu, X.: $$\\epsilon $$-coresets for clustering (with outliers) in doubling metrics. In: Proceedings of 50th ACM Symposium on Theory of Computing, pp. 814\u2013825 (2018)","DOI":"10.1109\/FOCS.2018.00082"},{"issue":"6","key":"15_CR16","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":"15_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(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"2\u20133","key":"15_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. 28(2\u20133), 89\u2013112 (2004)","journal-title":"Comput. Geom."},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 1\u201332 (2010)","journal-title":"J. ACM"},{"key":"15_CR20","unstructured":"Li, S., Guo, X.: Distributed $$k$$-clustering for data with heavy noise. In: Proceedings of 32nd Annual Conference on Neural Information Processing Systems, pp. 7849\u20137857 (2018)"},{"issue":"2","key":"15_CR21","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":"2","key":"15_CR22","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(2), 460\u2013482 (2015)","journal-title":"Algorithmica"},{"key":"15_CR23","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$$-means problem is NP-hard. Theoret. Comput. Sci. 442, 13\u201321 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR24","unstructured":"Makarychev, K., Makarychev, Y., Sviridenko, M., Ward, J.: A bi-criteria approximation algorithm for $$k$$-means. In: Proceedings of 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 20th International Workshop on Randomization and Computation, pp. 1\u201320 (2016)"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J Matousek","year":"2000","unstructured":"Matousek, J.: On approximate geometric $$k$$-clustering. Discrete Comput. Geom. 24(1), 61\u201384 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR26","unstructured":"Ravishankar, K., Li, S., Sai, S.: Constant approximation for $$k$$-median and $$k$$-means with outliers via iterative rounding. In: Proceedings of 50th ACM Symposium on Theory of Computing, pp. 646\u2013659 (2018)"},{"key":"15_CR27","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. Theoret. Comput. Sci. 749, 80\u201392 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"15_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf. Process. Lett. 94(3), 119\u2013123 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR29","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G Xu","year":"2009","unstructured":"Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17(4), 424\u2013436 (2009)","journal-title":"J. Comb. Optim."},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-319-62389-4_47","volume-title":"Computing and Combinatorics","author":"D Zhang","year":"2017","unstructured":"Zhang, D., Hao, C., Wu, C., Xu, D., Zhang, Z.: A local search approximation algorithm for the k-means problem with penalties. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 568\u2013574. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_47"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:19:18Z","timestamp":1709817558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","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":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 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":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}