Almost 3-Approximate Correlation Clustering in Constant Rounds

Soheil Behnezhad, Moses Charikar, Weiyun Ma +1

We study parallel algorithms for correlation clustering. Each pair among $n$ objects is labeled as either "similar" or "dissimilar". The goal is to partition the objects into arbit…