{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T09:30:16Z","timestamp":1744191016497},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_24","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"226-235","source":"Crossref","is-referenced-by-count":13,"title":["Correlation Clustering and Consensus Clustering"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Della Vedova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"24_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science\u00a0237(1\u20132), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"2000","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of \n                    \n                      \n                    \n                    $\\mathcal{NP}$\n                  -hard problems. Journal of Computer and System Sciences\u00a058, 193\u2013210 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating Inconsistent Information: Ranking and Clustering. In: Proc. 37th Symposium on Theory of Computing (STOC 2005), pp. 684\u2013693 (2005)","DOI":"10.1145\/1060590.1060692"},{"key":"24_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, V., Kann, G., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)"},{"issue":"1-3","key":"24_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.: Correlation clustering. Machine Learning\u00a056(1-3), 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proc. 44th Symp. Foundations of Computer Science (FOCS), pp. 524\u2013533 (2003)","DOI":"10.1109\/SFCS.2003.1238225"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-39658-1_21","volume-title":"Algorithms - ESA 2003","author":"D. Emanuel","year":"2003","unstructured":"Emanuel, D., Fiat, A.: Correlation clustering \u2013 minimizing disagreements on arbitrary weighted graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 208\u2013220. Springer, Heidelberg (2003)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Filkov, V., Skiena, S.: Integrating microarray data by consensus clustering. In: Proc. 15th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 418\u2013425 (2003)","DOI":"10.1109\/TAI.2003.1250220"},{"key":"24_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-24745-6_8","volume-title":"Data Integration in the Life Sciences","author":"V. Filkov","year":"2004","unstructured":"Filkov, V., Skiena, S.: Heterogeneous data integration with the consensus clustering formalism. In: Rahm, E. (ed.) DILS 2004. LNCS (LNBI), vol.\u00a02994, pp. 110\u2013123. Springer, Heidelberg (2004)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Mathematical Programming\u00a045, 52\u201396 (1989)","journal-title":"Mathematical Programming"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. Krivanek","year":"1986","unstructured":"Krivanek, M., Moravek, J.: Hard problems in hierarchical-tree clustering. Acta Informatica\u00a023, 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"key":"24_CR13","unstructured":"Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proc. 15th Symp. on Discrete Algorithms (SODA), pp. 526\u2013527 (2004)"},{"issue":"3","key":"24_CR14","first-page":"323","volume":"3","author":"Y. Wakabayashi","year":"1998","unstructured":"Wakabayashi, Y.: The complexity of computing medians of relations. Resenhas\u00a03(3), 323\u2013349 (1998)","journal-title":"Resenhas"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:39:16Z","timestamp":1553276356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11602613_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}