Correlation clustering with a fixed number of clusters
From MaRDI portal
Publication:3583431
DOI10.1145/1109557.1109686zbMath1194.62087arXivcs/0504023OpenAlexW2951430799MaRDI 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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Measures of association (correlation, canonical correlation, etc.) (62H20)
Related Items (17)
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 ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ A modeling and computational study of the frustration index in signed networks ⋮ Evaluating balancing on social networks through the efficient solution of correlation clustering problems ⋮ Ensemble clustering using semidefinite programming with applications ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Sublinear Algorithms for MAXCUT and Correlation Clustering ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Unnamed Item ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ A more effective linear kernelization for cluster editing ⋮ A simple and improved parameterized algorithm for bicluster editing ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
This page was built for publication: Correlation clustering with a fixed number of clusters