Travelled to:
1 × USA
Collaborated with:
S.Chawla K.Makarychev G.Yaroslavtsev
Talks about:
complet (2) algorithm (1) cluster (1) partit (1) correl (1) round (1) optim (1) graph (1) near (1)
Person: Tselil Schramm
DBLP: Schramm:Tselil
Contributed to:
Wrote 1 papers:
- STOC-2015-ChawlaMSY #algorithm #clustering #graph
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.