Publications [#302368] of Rong Ge

Papers Published

1. Arora, S; Ge, R; Sinop, AK, Towards a better approximation for SPARSEST CUT?, Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs (December, 2013), pp. 270-279, IEEE, ISSN 0272-5428 [doi]
   (last updated on 2026/01/15)

   Abstract:
   We give a new (1 + ε)-approximation for SPARSEST CUT problem on graphs where small sets expand significantly more than the sparsest cut (expansion of sets of size n/r exceeds that of the sparsest cut by a factor √ log n log r, for some small r; this condition holds for many natural graph families). We give two different algorithms. One involves Guruswami-Sinop rounding on the level-r Lasserre relaxation. The other is combinatorial and involves a new notion called Small Set Expander Flows (inspired by the expander flows of [1]) which we show exists in the input graph. Both algorithms run in time 2O(r)poly(n). We also show similar approximation algorithms in graphs with genus g with an analogous local expansion condition. This is the first algorithm we know of that achieves (1 + ε)-approximation on such general family of graphs. Copyright © 2013 by The Institute of Electrical and Electronics Engineers, Inc.