SIAM Journal on Optimization · 2015 · 39 citations · 30 references
ComputingComputer ScienceComputer NetworksData MiningOptimizationGraph AlgorithmsGraph MiningGraph TheoryApproximation GuaranteesCorrelation ClusteringPolynomial Time ComplexityPolynomial-time Algorithms
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.
30
Rank aggregation methods for the Web
Cynthia Dwork, Ravi Kumar, Moni Naor et al. · 2001 · 1.8K citations
On the Implementation of a Primal-Dual Interior Point Method
Sanjay Mehrotra · SIAM Journal on Optimization · 1992 · 1.6K citations
Nikhil Bansal, Avrim Blum, Shuchi Chawla · Machine Learning · 2004 · 1.1K citations · Full text