We solve several open problems concerning the correlation clustering problem introduced by Bansal, Blum and Chawla [1]. We give an equivalence argument between these problems and the multicut problem. This implies an O(log n) approximation algorithm for minimizing disagreements on weighted and unweighted graphs. The equivalence also implies that these problems are APX-hard and suggests that improving the upper bound to obtain a constant factor approximation is non trivial. We also briefly discuss some seemingly interesting applications of correlation clustering. © Springer-Verlag 2003.
CITATION STYLE
Emanuel, D., & Fiat, A. (2003). Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 208–220. https://doi.org/10.1007/978-3-540-39658-1_21
Mendeley helps you to discover research relevant for your work.