{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:52Z","timestamp":1740122452629,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T00:00:00Z","timestamp":1668988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T00:00:00Z","timestamp":1668988800000},"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. 12101594","No. 11871081","No. 11801310"],"award-info":[{"award-number":["No. 12101594","No. 11871081","No. 11801310"]}],"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"}]}],"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-00930-6","type":"journal-article","created":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T05:03:07Z","timestamp":1669006987000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation algorithms for the capacitated correlation clustering problem with penalties"],"prefix":"10.1007","volume":"45","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[]},{"given":"Gaidi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xianzhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"key":"930_CR1","unstructured":"Aboud A, Rabani Y (2008) Correlation clustering with penalties and approximating the reordering buffer management problem. Doctoral dissertation, Computer Science Department, Technion"},{"key":"930_CR2","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":"930_CR3","unstructured":"Ahn KJ, Cormode G, Guha S, Mcgregor A, Wirth A (2015) Correlation clustering in data streams. In: Proceedings of the 32nd international conference on machine learning, pp 2237\u20132246"},{"issue":"5","key":"930_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 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":"930_CR5","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"},{"key":"930_CR6","unstructured":"Bressan M, Cesa-Bianchi N, Paudice A, Vitale F (2019) Correlation clustering with adaptive similarity queries. In: Proceedings of the 32nd annual conference on neural information processing systems, pp 12510\u201312519"},{"issue":"1\u20132","key":"930_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-016-1067-6","volume":"163","author":"J Castro","year":"2017","unstructured":"Castro J, Nasini S, Saldanha-Da-Gama F (2017) 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","journal-title":"Math Program"},{"issue":"71","key":"930_CR8","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 (2005) Clustering with qualitative information. J Comput Syst Sci 3(71):360\u2013383","journal-title":"J Comput Syst Sci"},{"key":"930_CR9","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"},{"key":"930_CR10","doi-asserted-by":"crossref","unstructured":"Chen X, Hu X, Jia X, Li M, Tang Z, Wang C (2018) Mechanism design for two-opposite-facility location games with penalties on distance. In: Proceedings of the 10th international symposium on algorithmic game theory, pp 256\u2013260","DOI":"10.1007\/978-3-319-99660-8_24"},{"key":"930_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad V (2020) Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, pp 2241\u20132259","DOI":"10.1137\/1.9781611975994.138"},{"issue":"3","key":"930_CR12","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 MG (2021) On single-source capacitated facility location with cost and fairness objectives. Eur J Oper Res 289(3):959\u2013974","journal-title":"Eur J Oper Res"},{"key":"930_CR13","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":"930_CR14","doi-asserted-by":"crossref","unstructured":"Ji S, Cheng Y, Tan J, Zhao Z (2021) An improved approximation algorithm for capacitated correlation clustering problem. In: Proceedings of the 15th annual international conference on combinatorial optimization and applications, pp 35\u201345","DOI":"10.1007\/978-3-030-92681-6_4"},{"key":"930_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2019.01.003","volume":"264","author":"S Ji","year":"2019","unstructured":"Ji S, Xu D, Du D, Wu C (2019) Approximation algorithms for the fault-tolerant facility location problem with penalties. Discret Appl Math 264:62\u201375","journal-title":"Discret Appl Math"},{"key":"930_CR16","unstructured":"Lange JH, Karrenbauer A, Andres B (2018) 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"},{"issue":"5","key":"930_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 GJ, Milenkovic O (2019) Motif and hypergraph correlation clustering. IEEE Trans Inf Theory 66(5):3065\u20133078","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"930_CR18","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":"930_CR19","doi-asserted-by":"crossref","unstructured":"Thiel E, Chehreghani MH, Dubhashi D (2019) A non-convex optimization approach to correlation clustering. In: Proceedings of the 33rd AAAI conference on artificial intelligence, pp 5159\u20135166","DOI":"10.1609\/aaai.v33i01.33015159"},{"issue":"2","key":"930_CR20","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11081-020-09503-0","volume":"21","author":"Y Xu","year":"2020","unstructured":"Xu Y, M\u00f6hring RH, Xu D, Zhang Y, Zou Y (2020) A constant FPT approximation algorithm for hard-capacitated $$k$$-means. Optim Eng 21(2):709\u2013722","journal-title":"Optim Eng"},{"issue":"2","key":"930_CR21","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10878-018-0278-6","volume":"37","author":"D Zhang","year":"2019","unstructured":"Zhang D, Hao C, Wu C, Xu D, Zhang Z (2019) Local search approximation algorithms for the $$k$$-means problem with penalties. J Comb Optim 37(2):439\u2013453","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00930-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00930-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-00930-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:45:59Z","timestamp":1675496759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00930-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["930"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00930-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,11,21]]},"assertion":[{"value":"28 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}