12 citations · 27 across the 12 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 3 cited
Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs
Venkatesan Guruswami, Ali Kemal Sinop
We present an approximation scheme for minimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This…
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…