Improved approximation algorithms for capacitated cluster editing
cs.DS, cs.LG
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Understanding the Cluster LP for Correlation Clustering
- Approximate Dual Separation for the Cluster LP: a 1.387-approximation for Correlation Clustering
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