2014/11/03 by Gregory J. Puleo, Olgica Milenkovic, Olgica Milenković +2 · 6 citations
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Advanced Graph Theory Research #Bayesian Methods and Mixture Models #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #cs.DS #cs.LG
paper · pdf · doi:10.48550/arxiv.1411.0547
17 pages, simplified the last section and fixed some other minor errors
openalex publication_date 2014/11/03 · arxiv created 2015/05/22 · arxiv updated 2015/05/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.