{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:43Z","timestamp":1759638943830},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,31]],"date-time":"2013-03-31T00:00:00Z","timestamp":1364688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9607-y","type":"journal-article","created":{"date-parts":[[2013,3,30]],"date-time":"2013-03-30T03:46:54Z","timestamp":1364615214000},"page":"488-501","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms and complexity results for labeled correlation clustering problem"],"prefix":"10.1007","volume":"29","author":[{"given":"Xianmin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,31]]},"reference":[{"key":"9607_CR1","doi-asserted-by":"crossref","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. J ACM 55(2):23:1\u201323:27","DOI":"10.1145\/1411509.1411513"},{"issue":"1\u20133","key":"9607_CR2","doi-asserted-by":"crossref","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":"9607_CR3","first-page":"299","volume":"31","author":"H Broersma","year":"2005","unstructured":"Broersma H, Li X, Woeginger G, Zhang S (2005) Paths and cycles in colored graphs. Australas J Comb 31:299\u2013311","journal-title":"Australas J Comb"},{"issue":"3","key":"9607_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(02)00241-9","volume":"31","author":"T Br\u00fcGgemann","year":"2003","unstructured":"Br\u00fcGgemann T, Monnot J, Woeginger GJ (2003) Local search for the minimum label spanning tree problem with bounded color classes. Oper Res Lett 31(3):195\u2013201","journal-title":"Oper Res Lett"},{"key":"9607_CR5","unstructured":"Carr RD, Doddi S, Konjevod G, Marathe M (2000) On the red-blue set cover problem. In: Proceedings of the 11th ACM-SIAM SODA pp 345\u2013353"},{"issue":"3","key":"9607_CR6","doi-asserted-by":"crossref","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"},{"issue":"2","key":"9607_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine ED, Emanuel D, Fiat A, Immorlica N (2006) Correlation clustering in general weighted graphs. Theor Comput Sci 361(2):172\u2013187","journal-title":"Theor Comput Sci"},{"key":"9607_CR8","doi-asserted-by":"crossref","unstructured":"Fellows MR, Guo J, Kanj I (2010) The parameterized complexity of some minimum label problems. J Comput Syst Sci 76:727\u2013740","DOI":"10.1016\/j.jcss.2010.02.012"},{"key":"9607_CR9","volume-title":"Computers intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"key":"9607_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R Hassin","year":"2007","unstructured":"Hassin R, Monnot J, Segev D (2007) Approximation algorithms and hardness results for labeled connectivity problems. J Comb Optim 14:437\u2013453","journal-title":"J Comb Optim"},{"key":"9607_CR11","doi-asserted-by":"crossref","unstructured":"Jha S, Sheyner O, Wing J (2002) Two formal analys s of attack graphs. In: Proceedings of the 15th IEEE workshop on computer security foundations","DOI":"10.1109\/CSFW.2002.1021806"},{"key":"9607_CR12","doi-asserted-by":"crossref","unstructured":"Malioutov I, Barzilay R (2006) Minimum cut model for spoken lecture segmentation. In: Proceedings of COLING-ACL","DOI":"10.3115\/1220175.1220179"},{"key":"9607_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou C, Yannakakis M (1988) Optimization, approximation, and complexity classes. In: Proceedings of the 20th ACM symposium on theory of computing pp 229\u2013234","DOI":"10.1145\/62212.62233"},{"issue":"4","key":"9607_CR14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1162\/089120101753342653","volume":"27","author":"WM Soon","year":"2001","unstructured":"Soon WM, Ng HT, Lim DCY (2001) A machine learning approach to coreference resolution of noun phrases. Comput Linguist 27(4):521\u2013544","journal-title":"Comput Linguist"},{"key":"9607_CR15","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s10878-009-9222-0","volume":"21","author":"P Zhang","year":"2011","unstructured":"Zhang P, Cai JY, Tang LQ, Zhao WB (2011) Approximation and hardness results for label cut and related problems. J Comb Optim 21:192\u2013208","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9607-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9607-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9607-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T15:12:31Z","timestamp":1562857951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9607-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,31]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9607"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9607-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,31]]}}}