{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:09:14Z","timestamp":1742915354056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_15","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"159-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes"],"prefix":"10.1007","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","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"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"15_CR1","unstructured":"Amit, N.: The bicluster graph editing problem. Diss, Tel Aviv University (2004)"},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/110848712","volume":"41","author":"N Ailon","year":"2012","unstructured":"Ailon, N., Avigdor-Elgrabli, N., Liberty, E., Zuylen, A.V.: Improved approximation algorithms for bipartite correlation clustering. SIAM J. Comput. 41(5), 1110\u20131121 (2012)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/sam.10012","volume":"1","author":"Elke Achtert","year":"2008","unstructured":"Achtert, E., B$$\\ddot{o}$$hm, C., David, J., Kr$$\\ddot{o}$$ger, P., Zimek, A.: Global correlation clustering based on the hough transform. Stat. Anal. Data Min. 1(3), 111\u2013127 (2010)","journal-title":"Statistical Analysis and Data Mining"},{"key":"15_CR4","unstructured":"Ahn, K.J., Cormode, G., Guha, S., Mcgregor, A., Wirth, A.: Correlation clustering in data streams. In: Proceedings of the 32th International Conference on International Conference on Machine Learning (ICML), pp. 2237\u20132246 (2015)"},{"issue":"5","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"Nir Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM, 55(5), Article No. 23 (2008)","journal-title":"Journal of the ACM"},{"key":"15_CR6","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)"},{"key":"15_CR7","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 the 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-012-0522-9","volume":"35","author":"F Bonchi","year":"2013","unstructured":"Bonchi, F.: Overlapping correlation clustering. Knowl. Inf. Syst. 35(1), 1\u201332 (2013)","journal-title":"Knowl. Inf. Syst."},{"issue":"1\u20133","key":"15_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated $$k$$-median problems. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 722\u2013736 (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Braverman, V., Lang, H., Levin, K., Monemizadeh, M.: Clustering problems on sliding windows. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1374\u20131390 (2016)","DOI":"10.1137\/1.9781611974331.ch95"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Chawla, S., Makarychev, K., Schramm, T., Yaroslavtsev, G.: Near optimal LP rounding algorithm for correlationclustering on complete and complete k-partite graphs. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pp. 219\u2013228 (2015)","DOI":"10.1145\/2746539.2746604"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"E Demaine","year":"2006","unstructured":"Demaine, E., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361(2), 172\u2013187 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithms for maxk-cut and max bisection. Algorithmica 18(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1167\u20131176 (2006)","DOI":"10.1145\/1109557.1109686"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated $$k$$-median beyond the natural LP relaxation. ACM Trans. Algorithms, 13(2), Article No. 22 (2017)","DOI":"10.1145\/2983633"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595919500064","volume":"36","author":"M Li","year":"2019","unstructured":"Li, M., Xu, D., Zhang, D., Zhang, T.: A streaming algorithm for k-means with approximate coreset. Asia Pac. J. Oper. Res. 36, 1\u201318 (2019)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Mathieu, C., Schudy, W.: Correlation clustering with noisy input. In: Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 712\u2013728 (2010)","DOI":"10.1137\/1.9781611973075.58"},{"issue":"2","key":"15_CR21","first-page":"211","volume":"21","author":"C Mathieu","year":"2010","unstructured":"Mathieu, C., Sankur, O., Schudy, W.: Online correlation clustering. Comput. Stat. 21(2), 211\u2013229 (2010)","journal-title":"Comput. Stat."},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1137\/140994198","volume":"25","author":"GJ Puleo","year":"2015","unstructured":"Puleo, G.J., Milenkovic, O.: Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J. Optim. 25(3), 1857\u20131872 (2015)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"15_CR23","doi-asserted-by":"publisher","first-page":"4105","DOI":"10.1109\/TIT.2018.2819696","volume":"64","author":"GJ Puleo","year":"2018","unstructured":"Puleo, G.J., Milenkovic, O.: Correlation clustering and biclustering with locally bounded errors. IEEE Trans. Inf. Theory 64(6), 4105\u20134119 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR24","unstructured":"Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 526\u2013527 (2004)"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:16:49Z","timestamp":1709824609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_15","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"}}]}}