50 citations · 210 across the 29 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 3 cited
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs
Shuchi Chawla, Konstantin Makarychev, Tselil Schramm +1
We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality g…
math.PR2014★ 10 cited
Global and Local Information in Clustering Labeled Block Models
Varun Kanade, Elchanan Mossel, Tselil Schramm
The stochastic block model is a classical cluster-exhibiting random graph model that has been widely studied in statistics, physics and computer science. In its simplest form, the…