Correlation clustering with a fixed number of clusters

DOI10.1145/1109557.1109686zbMath1194.62087arXivcs/0504023MaRDI QIDQ3583431

Ioannis Giotis, Venkatesan Guruswami

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0504023

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

62H20: Measures of association (correlation, canonical correlation, etc.)

Related Items

Unnamed Item, Sublinear Algorithms for MAXCUT and Correlation Clustering, Correlation clustering and two-edge-connected augmentation for planar graphs, Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem, Branch-and-cut approaches for \(p\)-cluster editing, A more effective linear kernelization for cluster editing, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, Ensemble clustering using semidefinite programming with applications, Branch-and-price for \(p\)-cluster editing, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, A simple and improved parameterized algorithm for bicluster editing, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, Approximation algorithm for min-max correlation clustering problem with outliers, Approximation algorithms for two variants of correlation clustering problem, Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability, Tight bounds for parameterized complexity of cluster editing with a small number of clusters