{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:09:47Z","timestamp":1750748987041,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_4","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Approximation Algorithm for\u00a0Capacitated Correlation Clustering Problem"],"prefix":"10.1007","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongrui","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"5","key":"4_CR1","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."},{"key":"4_CR2","unstructured":"Ahn, K.J., Cormode, G., Guha, S., Mcgregor, A., Wirth, A.: Correlation clustering in data streams. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2237\u20132246 (2015)"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ahmadi, S., Khuller, S., Saha, B.: Min-max correlation clustering via multicut. In: Proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, pp. 13\u201326 (2019)","DOI":"10.1007\/978-3-030-17953-3_2"},{"key":"4_CR5","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, pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"issue":"1\u20133","key":"4_CR6","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":"4_CR7","unstructured":"Bressan, M., Cesa-Bianchi, N., Paudice, A., Vitale, F.: Correlation clustering with adaptive similarity queries. In: Proceedings of the 32nd Annual Conference on Neural Information Processing Systems, pp. 12510\u201312519 (2019)"},{"issue":"1","key":"4_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., Gionis, A., Ukkonen, A.: Overlapping correlation clustering. Knowl. Inf. Syst. 35(1), 1\u201332 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR9","unstructured":"Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: Proceedings of the 37th International Conference on Machine Learning, pp. 405\u2013413 (2019)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2241\u20132259 (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"4_CR11","unstructured":"Choo, D., Grunau, C., Portmann, J., Rozhon, V.: $$k$$-means++: few more steps yield constant approximation. In: Proceedings of the 37th International Conference on Machine Learning, pp. 1909\u20131917 (2020)"},{"issue":"71","key":"4_CR12","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"3","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 3(71), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"4_CR13","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."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Chawla, S., Makarychev, K., Schramm, T., Yaroslavtsev, G.: Near optimal LP rounding algorithm for correlation clustering on complete and complete $$k$$-partite graphs. In: Proceedings of the 47th ACM Symposium on Theory of Computing, pp. 219\u2013228 (2015)","DOI":"10.1145\/2746539.2746604"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Castro, J., Nasini, S., Saldanha-Da-Gama, F.: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1\u20132), 411\u2013444 (2021)","DOI":"10.1007\/s10107-016-1067-6"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.ejor.2019.07.045","volume":"289","author":"C Filippi","year":"2021","unstructured":"Filippi, C., Guastaroba, G., Speranza, M.G.: On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3), 959\u2013974 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1109\/TPAMI.2014.2303095","volume":"36","author":"S Kim","year":"2014","unstructured":"Kim, S., Yoo, C.D., Nowozin, S., Kohli, P.: Image segmentation using higher-order correlation clustering. IEEE Trans. Patt. Anal. Mach. Intell. 36(9), 1761\u20131774 (2014)","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"4_CR18","unstructured":"Lange, J.H., Karrenbauer, A., Andres, B.: Partial optimality and fast lower bounds for weighted correlation clustering. In: Proceedings of the 35th International Conference on International Conference on Machine Learning, pp. 2892\u20132901 (2018)"},{"issue":"2","key":"4_CR19","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."},{"key":"4_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, pp. 712\u2013728 (2010)","DOI":"10.1137\/1.9781611973075.58"},{"issue":"3","key":"4_CR21","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."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Thiel, E., Chehreghani, M.H., Dubhashi, D.: A non-convex optimization approach to correlation clustering. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 5159\u20135166 (2019)","DOI":"10.1609\/aaai.v33i01.33015159"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Veldt, N., Wirth, A., Gleich, D.F.: Parameterized correlation clustering in hypergraphs and bipartite graphs. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1868\u20131876 (2020)","DOI":"10.1145\/3394486.3403238"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:03:24Z","timestamp":1639353804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_4","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)"}}]}}