{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:53Z","timestamp":1740122453636,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 11871081","No. 12101594"],"award-info":[{"award-number":["No. 11871081","No. 12101594"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["No. 2021M693337"],"award-info":[{"award-number":["No. 2021M693337"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["06446","No. 11771386","NO. 11971349"],"award-info":[{"award-number":["06446","No. 11771386","NO. 11971349"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 71771117"],"award-info":[{"award-number":["No. 71771117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00976-6","type":"journal-article","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T06:02:26Z","timestamp":1672466546000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation algorithms for the lower bounded correlation clustering problem"],"prefix":"10.1007","volume":"45","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinhong","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongzhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,31]]},"reference":[{"key":"976_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi S, Khuller S, Saha B (2019) Min-max correlation clustering via multicut. In: Proceedings of the 20th international conference on integer programming and combinatorial optimization, pp 13\u201326","DOI":"10.1007\/978-3-030-17953-3_2"},{"key":"976_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian S, Swamy C (2012) Improved approximation guarantees for lower-bounded facility location. In: Proceedings of the 10th international workshop on approximation and online algorithms, pp 257\u2013271","DOI":"10.1007\/978-3-642-38016-7_21"},{"issue":"5","key":"976_CR3","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 AV (2012) Improved approximation algorithms for bipartite correlation clustering. SIAM J Comput 41(5):1110\u20131121","journal-title":"SIAM J Comput"},{"issue":"1\u20133","key":"976_CR4","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 (2004) Correlation clustering. Mach Learn 56(1\u20133):89\u2013113","journal-title":"Mach Learn"},{"issue":"1","key":"976_CR5","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 (2013) Overlapping correlation clustering. Knowl Inf Syst 35(1):1\u201332","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"976_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2728170","volume":"9","author":"F Bonchi","year":"2015","unstructured":"Bonchi F, Gionis A, Gullo F, Tsourakakis CE, Ukkonen A (2015) Chromatic correlation clustering. ACM Trans Knowl Discov Data 9(4):1\u201324","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"976_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 (2005) Clustering with qualitative information. J Comput Syst Sci 71(3):360\u2013383","journal-title":"J Comput Syst Sci"},{"key":"976_CR8","doi-asserted-by":"crossref","unstructured":"Chawla S, Makarychev K, Schramm T, Yaroslavtsev G (2015) 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","DOI":"10.1145\/2746539.2746604"},{"issue":"4","key":"976_CR9","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1007\/s10878-018-0354-y","volume":"37","author":"T Fukunaga","year":"2019","unstructured":"Fukunaga T (2019) LP-based pivoting algorithm for higher-order correlation clustering. J Comb Optim 37(4):1312\u20131326","journal-title":"J Comb Optim"},{"key":"976_CR10","doi-asserted-by":"crossref","unstructured":"Han L, Hao C, Wu C, Zhang Z (2020) Approximation algorithms for the lower-bounded $$k$$-median and its generalizations. In: Proceedings of the 26th international computing and combinatorics conference, pp 627\u2013639","DOI":"10.1007\/978-3-030-58150-3_51"},{"key":"976_CR11","unstructured":"Jafarov J, Kalhan S, Makarychev K, Makarychev Y (2020) Correlation clustering with asymmetric classification errors. In: Proceedings of the 37th international conference on machine learning, pp 4641\u20134650"},{"key":"976_CR12","doi-asserted-by":"crossref","unstructured":"Li S (2019) On facility location with general lower bounds. In: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, pp 2279\u20132290","DOI":"10.1137\/1.9781611975482.138"},{"issue":"5","key":"976_CR13","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/TIT.2019.2940246","volume":"66","author":"P Li","year":"2019","unstructured":"Li P, Puleo GJ, Milenkovic O (2019) Motif and hypergraph correlation clustering. IEEE Trans Inf Theory 66(5):3065\u20133078","journal-title":"IEEE Trans Inf Theory"},{"key":"976_CR14","unstructured":"Makarychev K, Makarychev Y, Vijayaraghavan A (2015) Correlation clustering with noisy partial information. In: Proceedings of the 28th annual conference computational learning theory, pp 1321\u20131342"},{"key":"976_CR15","doi-asserted-by":"crossref","unstructured":"Mathieu C, Schudy W (2010) Correlation clustering with noisy input. In: Proceedings of the 21th annual ACM-SIAM symposium on discrete algorithms, pp 712\u2013728","DOI":"10.1137\/1.9781611973075.58"},{"issue":"3","key":"976_CR16","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1137\/140994198","volume":"25","author":"GJ Puleo","year":"2015","unstructured":"Puleo GJ, Milenkovic O (2015) Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J Optim 25(3):1857\u20131872","journal-title":"SIAM J Optim"},{"key":"976_CR17","unstructured":"Saha B, Subramanian S (2019) Correlation clustering with same-cluster queries bounded by optimal cost. In: Proceedings of the 27th annual European symposium on algorithms, pp 81:1\u201381:17"},{"issue":"4","key":"976_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824777.1824789","volume":"6","author":"Z Svitkina","year":"2010","unstructured":"Svitkina Z (2010) Lower-bounded facility location. ACM Trans Algorithms 6(4):1\u201316","journal-title":"ACM Trans Algorithms"},{"key":"976_CR19","unstructured":"Swamy C (2004) Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms, pp 526\u2013527"},{"key":"976_CR20","doi-asserted-by":"crossref","unstructured":"Veldt N, Gleich DF, Wirth A (2018) A correlation clustering framework for community detection. In: Proceedings of the 27th world wide web conference, pp 439\u2013448","DOI":"10.1145\/3178876.3186110"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00976-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00976-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00976-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:50:54Z","timestamp":1675497054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00976-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,31]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["976"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00976-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,12,31]]},"assertion":[{"value":"22 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"43"}}