#correlation clustering

try —

1 paper match

cs.DS2026

Approximate Dual Separation for the Cluster LP: a 1.387 approximation for Correlation Clustering

David García-Soriano, Antoine Schohn

The paper presents a (1.3865+ε)-approximation algorithm for correlation clustering on complete graphs by introducing an efficient approximate dual separation oracle for the cluster…

#correlation clustering#approximation algorithms#linear programming#dual separation