Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms

Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this problem. Meanwhile, another line of research has focused on porting the classical advances to various sublinear algorithm models, including semi-streaming, Massively Parallel Computation (MPC), and distributed computing. Yet, these latter works typically rely on ad-hoc approaches that do not necessarily keep up with advances in improved approximation ratios achieved by classical algorithms. This raises the following natural question: can the gains made by classical algorithms for correlation clustering be ported over to sublinear algorithms in a black-box manner? We answer this question in the affirmative by introducing the paradigm of graph de-sparsification that may be of independent interest.

 

Joint work with Sepehr Assadi and Sanjeev Khanna.