57 citations · 245 across the 48 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Online Bipartite Matching with Decomposable Weights
Moses Charikar, Monika Henzinger, Huy L. Nguyen
We study a weighted online bipartite matching problem: is a weighted bipartite graph where is known beforehand and the vertices of arrive online. The g…
stat.ML2014★ 6 cited
Relax, no need to round: integrality of clustering formulations
Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar +3
We study exact recovery conditions for convex relaxations of point cloud clustering problems, focusing on two of the most common optimization problems for unsupervised clustering:…