2 papers
cs.CC2015
The Hardness of Approximation of Euclidean k-means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy +1
The Euclidean -means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry commun…
cs.DS2013
Towards a better approximation for sparsest cut?
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
We give a new -approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size expand by a factor $\sqr…