{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:18:35Z","timestamp":1743106715398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_52","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"668-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for\u00a0Min-Max Correlation Clustering Problem with\u00a0Outliers"],"prefix":"10.1007","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Liang","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":[[2021,12,11]]},"reference":[{"issue":"5","key":"52_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":"52_CR2","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), Article No. 23 (2008)","DOI":"10.1145\/1411509.1411513"},{"issue":"1\u20133","key":"52_CR3","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":"52_CR4","unstructured":"Bressan, M., Cesa-Bianchi, N., Paudice, A., Vitale, F.: Correlation clustering with adaptive similarity queries. In: Proceedings of NeurIPS, pp. 12510\u201312519 (2019)"},{"key":"52_CR5","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 (2014)","DOI":"10.1137\/1.9781611973730.49"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Gupta, N., Schwartz, R.: Local guarantees in graph cuts and clustering. In: Proceedings of IPCO, pp. 136\u2013147 (2017)","DOI":"10.1007\/978-3-319-59250-3_12"},{"issue":"3","key":"52_CR7","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":"52_CR8","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":"52_CR9","unstructured":"Chehreghani, M.H.: Hierarchical correlation clustering and tree preserving embedding (2020). ArXiv preprint arXiv: 2002.07756"},{"issue":"4","key":"52_CR10","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1007\/s10878-018-0354-y","volume":"37","author":"T Fukunaga","year":"2018","unstructured":"Fukunaga, T.: LP-based pivoting algorithm for higher-order correlation clustering. J. Comb. Optim. 37(4), 1312\u20131326 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0354-y","journal-title":"J. Comb. Optim."},{"key":"52_CR11","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"},{"issue":"24","key":"52_CR12","doi-asserted-by":"publisher","first-page":"3717","DOI":"10.1093\/bioinformatics\/btw546","volume":"32","author":"JP Hou","year":"2016","unstructured":"Hou, J.P., Emad, A., Puleo, G.J., Ma, J., Milenkovic, O.: A new correlation clustering method for cancer mutation analysis. Bioinformatics 32(24), 3717\u20133728 (2016)","journal-title":"Bioinformatics"},{"key":"52_CR13","unstructured":"Jafarov, J., Kalhan, S., Makarychev, K., Makarychev, Y.: Correlation clustering with asymmetric classification errors. In: Proceedings of ICML, pp. 4641\u20134650 (2020)"},{"issue":"9","key":"52_CR14","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. Pattern Anal. Mach. Intell. 36(9), 1761\u20131774 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"52_CR15","unstructured":"Krishnaswamy, R., Rajaraman, N.: Robust correlation clustering. In: Proceedings of APPROX\/RANDOM, pp. 33:1\u201333:18 (2019)"},{"key":"52_CR16","unstructured":"Lange, J.H., Karrenbauer, A., Andres, B.: Partial optimality and fast lower bounds for weighted correlation clustering. In: Proceedings of ICML, pp. 2892\u20132901 (2018)"},{"issue":"5","key":"52_CR17","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/TIT.2019.2940246","volume":"66","author":"P Li","year":"2019","unstructured":"Li, P., Puleo, G.J., Milenkovic, O.: Motif and hypergraph correlation clustering. IEEE Trans. Inf. Theory 66(5), 3065\u20133078 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"52_CR18","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1007\/s10878-021-00726-0","volume":"41","author":"W Lv","year":"2021","unstructured":"Lv, W., Wu, C.: An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties. J. Comb. Optim. 41(4), 888\u2013904 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00726-0","journal-title":"J. Comb. Optim."},{"key":"52_CR19","unstructured":"Makarychev, K., Makarychev, Y., Vijayaraghavan, A.: Correlation clustering with noisy partial information. In: Proceedings of COLT, pp. 1321\u20131342 (2015)"},{"key":"52_CR20","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"},{"issue":"6","key":"52_CR21","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"},{"issue":"3","key":"52_CR22","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2020.09.026","volume":"291","author":"A Saif","year":"2021","unstructured":"Saif, A., Delage, E.: Data-driven distributionally robust capacitated facility location problem. Eur. J. Oper. Res. 291(3), 995\u20131007 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR23","doi-asserted-by":"crossref","unstructured":"Thiel, E., Chehreghani, M.H., Dubhashi, D.: A non-convex optimization approach to correlation clustering. In: Proceedings of AAAI, pp. 5159\u20135166 (2019)","DOI":"10.1609\/aaai.v33i01.33015159"},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Ukkonen, A.: Crowdsourced correlation clustering with relative distance comparisons. In: Proceedings of ICDM, pp. 1117\u20131122 (2017)","DOI":"10.1109\/ICDM.2017.148"},{"key":"52_CR25","unstructured":"Vainstein, D., Chatziafratis, V., Citovsky, G., Rajagopalan, A., Mahdian, M., Azar, Y.: Hierarchical clustering via sketches and hierarchical correlation clustering (2021). ArXiv preprint arXiv: 2101.10639"},{"issue":"9","key":"52_CR26","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1007\/s00500-018-3562-6","volume":"23","author":"I Vasilyev","year":"2019","unstructured":"Vasilyev, I., Ushakov, A.V., Maltugueva, N., Sforza, A.: An effective heuristic for large-scale fault-tolerant k-median problem. Soft Comput. 23(9), 2959\u20132967 (2019)","journal-title":"Soft Comput."},{"key":"52_CR27","doi-asserted-by":"crossref","unstructured":"Veldt, N., Gleich, D.F., Wirth, A.: A correlation clustering framework for community detection. In: Proceedings of WWW, pp. 439\u2013448 (2018)","DOI":"10.1145\/3178876.3186110"}],"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_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:10:10Z","timestamp":1639354210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_52","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)"}}]}}