{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:00:53Z","timestamp":1743152453882,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576011"},{"type":"electronic","value":"9783030576028"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57602-8_9","type":"book-chapter","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T01:02:43Z","timestamp":1596934963000},"page":"97-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs"],"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":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Gai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Achtert, E., B$$\\ddot{\\rm o}$$hm, C., David, J., Kr$$\\ddot{\\rm o}$$ger, P., Zimek, A.: Global correlation clustering based on the Hough transform. Stat. Anal. Data Mining 1, 111\u2013127 (2010)","DOI":"10.1002\/sam.10012"},{"key":"9_CR2","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":"9_CR3","unstructured":"Ahn, K.J., Cormode, G., Guha, S., Mcgregor, A., Wirth, A.: Correlation clustering in data streams. In: Proceedings of ICML, pp. 2237\u20132246 (2015)"},{"key":"9_CR4","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, 1110\u20131121 (2012)","journal-title":"SIAM J. Comput."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5) (2008). Article No. 23","DOI":"10.1145\/1411509.1411513"},{"key":"9_CR6","unstructured":"Amit, N.: The bicluster graph editing problem. Diss, Tel Aviv University (2004)"},{"key":"9_CR7","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-Means++: the advantages of careful seeding. In: Proceedings of SODA, pp. 1027\u20131035 (2007)"},{"key":"9_CR8","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, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-662-47672-7_10","volume-title":"Automata, Languages, and Programming","author":"B Behsaz","year":"2015","unstructured":"Behsaz, B., Friggstad, Z., Salavatipour, M.R., Sivakumar, R.: Approximation algorithms for min-sum k-clustering and balanced k-median. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 116\u2013128. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_10"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bonchi, F.: Overlapping correlation clustering. Knowl. Inf. Syst. 35, 1\u201332 (2013)","DOI":"10.1007\/s10115-012-0522-9"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Braverman, V., Lang, H., Levin, K., Monemizadeh, M.: Clustering problems on sliding windows. In: Proceedings of SODA, pp. 1374\u20131390 (2016)","DOI":"10.1137\/1.9781611974331.ch95"},{"key":"9_CR12","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 SODA, pp. 722\u2013736 (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"9_CR13","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, 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_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 STOC, pp. 219\u2013228 (2015)","DOI":"10.1145\/2746539.2746604"},{"key":"9_CR15","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, 172\u2013187 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR16","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 max $$k$$-cut and max bisection. Algorithmica 18, 67\u201381 (1997)","journal-title":"Algorithmica"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proceedings of SODA, pp. 1167\u20131176 (2006)","DOI":"10.1145\/1109557.1109686"},{"key":"9_CR18","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, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/TAC.2012.2203214","volume":"58","author":"JM Hendrickx","year":"2013","unstructured":"Hendrickx, J.M., Tsitsiklis, J.N.: Convergence of type-symmetric and cut-balanced consensus seeking systems. IEEE Trans. Autom. Control 58, 214\u2013218 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-27195-4_15","volume-title":"Algorithmic Aspects in Information and Management","author":"S Ji","year":"2019","unstructured":"Ji, S., Xu, D., Li, M., Wang, Y.: Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes. In: Du, D.-Z., Li, L., Sun, X., Zhang, J. (eds.) AAIM 2019. LNCS, vol. 11640, pp. 159\u2013168. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27195-4_15"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11227-013-1024-6","volume":"68","author":"P Kuila","year":"2013","unstructured":"Kuila, P., Jana, P.K.: Approximation schemes for load balanced clustering in wireless sensor networks. J. Supercomput. 68(1), 87\u2013105 (2013). https:\/\/doi.org\/10.1007\/s11227-013-1024-6","journal-title":"J. Supercomput."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated $$k$$-median beyond the natural LP relaxation. ACM Trans. Algorithms 13(2) (2017). Article No. 22","DOI":"10.1145\/2983633"},{"issue":"01","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1950006","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 Pacific J. Oper. Res. 36(01), 1950006 (2019)","journal-title":"Asia Pacific J. Oper. Res."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1109\/JSEN.2012.2227704","volume":"13","author":"Y Liao","year":"2013","unstructured":"Liao, Y., Qi, H., Li, W.: Load-balanced clustering algorithm with distributed self-organization for wireless sensor networks. IEEE Sens. J. 13, 1498\u20131506 (2013)","journal-title":"IEEE Sens. J."},{"key":"9_CR25","first-page":"211","volume":"21","author":"C Mathieu","year":"2010","unstructured":"Mathieu, C., Sankur, O., Schudy, W.: Online correlation clustering. Comput. Stat. 21, 211\u2013229 (2010)","journal-title":"Comput. Stat."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Mathieu, C., Schudy, W.: Correlation clustering with noisy input. In: Proceedings of SODA, pp. 712\u2013728 (2010)","DOI":"10.1137\/1.9781611973075.58"},{"key":"9_CR27","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, 1857\u20131872 (2015)","journal-title":"SIAM J. Optim."},{"key":"9_CR28","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, 4105\u20134119 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144, 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9_CR30","unstructured":"Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of SODA, pp. 526\u2013527 (2004)"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TMC.2014.2338315","volume":"14","author":"M Zhao","year":"2015","unstructured":"Zhao, M., Yang, Y., Wang, C.: Mobile data gathering with load balanced clustering and dual data uploading in wireless sensor networks. IEEE Trans. Mob. Comput. 14, 770\u2013785 (2015)","journal-title":"IEEE Trans. Mob. Comput."}],"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-57602-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:48:08Z","timestamp":1710359288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57602-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576011","9783030576028"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57602-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 August 2020","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":"Jinhua","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sjxy.zjnu.edu.cn\/AAIM2020\/list.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"76","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":"39","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":"17","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":"51% - 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":"3.3","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":"8.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}