Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Foundations of Computer Science (FOCS), pp. 238–247 (2002)
Calinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO) (1998)
Demaine, E.D., Nicole, I.: Correlation clustering with partial information. In: APPROX (2003)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts. In: Proceedings, 24th ACM Symposium on Theory of Computing, pp. 241–251 (1992)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 4(23), 864–894 (1994)
Garg, N., Vazirani, V., Yannakakis, M.: Primal−Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. In: Proceedings of ICLP, pp. 64–75 (1993)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. In: 25th STOC, pp. 698–707 (1993)
Hu, T.C.: Multicommodity network flows. Operations Research (11), 344–360 (1963)
Klein, D., Kamvar, S.D., Manning, C.D.: From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In: Proceedings of the Nineteenth International Conference on Machine Learning (2002)
Leighton, T., Rao, S.: An approximate max-flow mincut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proc. of the 29th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 422–431 (1988)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Symposium on Math, Statistics, and Probability, pp. 281–297 (1967)
Guruswami, V., Charikar, M., Wirth, T.: Personal communication (2003)
Tardos, E., Vazirani, V.V.: Improved bounds for the max flow min multicut ratio for planar and K r,r –free graphs. Information Processing Letters, 698–707 (1993)
Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 1103–1110 (2000)
Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 577–584 (2001)
Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.C., Papadimitriou, C.H.: Cutting and partitioning a graph after a fixed pattern. In: Proceedings, 10th Intl. Coll. on Automata, Languages and Programming, pp. 712–722 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emanuel, D., Fiat, A. (2003). Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive