Approximate Dual Separation for the Cluster LP: a 1.387-approximation for Correlation Clustering
cs.DS
Submitted: 2026-07-30
Updated: 2026-11-03
Terminology
Sources
- Constrained Correlation Clustering: Towards Optimality
- Local correlation clustering
- Understanding the Cluster LP for Correlation Clustering
- Cluster Deletion is as Hard to Approximate as Vertex Cover
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time