Optimal Approximation for Constrained Correlation Clustering via Repulsion
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/openai/math
Terminology
Sources
- CKR Partitions and Lower Bounds for Constrained Correlation Clustering and Variants
- Constrained Correlation Clustering: Towards Optimality
- Understanding the Cluster LP for Correlation Clustering
- Pseudometric-Weighted Correlation Clustering via Spectral Preclustering
- Approximate Dual Separation for the Cluster LP: a 1.387-approximation for Correlation Clustering
- 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
Related papers
- 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
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles