Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
Not on the map. Why?
Abstract (arXiv)
We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering with bounded cluster sizes. Second, we extend the regime of weight values for which the clustering may be performed with constant approximation guarantees in polynomial time and apply the results to the bounded cluster size problem.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Nov 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2; 2025: 1; 2026: 1.
6 papers.
- 2021Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Boundscited by 12
- 2022Exact Community Recovery over Signed Graphscited by 3
- 2024Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Bettercited by 0
- 2024Multilayer Correlation Clusteringcited by 0
- 2025Online Correlation Clustering: Simultaneously Optimizing All ℓp-normscited by 0
- 2026Correlation Clustering with Random Partial Informationcited by 0
- 2026Correlation Clustering with Random Partial Information17 Aug 2026
- 2025Online Correlation Clustering: Simultaneously Optimizing All ℓp-norms16 Oct 2025
- 2024Multilayer Correlation Clustering25 Apr 2024
- 2024Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better24 Apr 2024
- 2022Exact Community Recovery over Signed Graphs22 Feb 2022
- 2021Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds20 Nov 2021