Add to ORKGWe show how to compute O (√log n)-approximations to Sparsest Cut and Balanced Separator problems in Õ(n²) time, thus improving upon the recent algorithm of Arora, Rao and Vazirani (2004). Their algorithm uses semidefinite programming and required Õ(n4.5) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander flows was also established by Arora, Rao, and Vazirani
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
Given a graph G, the sparsest-cut problem asks to find the set of vertices S which has the least exp...
International audienceIt has long been known, since the classical work of (Arora, Karger, Karpinski,...
We show that the sparsest cut in graphs can be approximated within O(log 2 n) factor in Õ(n3/2) time...
We give a new (1 + ε)-approximation for SPARSEST CUT problem on graphs where small sets expand signi...
We give a new (1 + )-approximation for sparsest cut problem on graphs where small sets expand signif...
We give a O( # log n)-approximation algorithm for sparsest cut, balanced separator, and graph cond...
We give a 2-approximation algorithm for the non-uniform Sparsest Cut problem that runs in time nO(k)...
We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time nO(k), where k is...
In this paper we present two combinatorial algorithms for Sparsest Cut which achieve an O(logn) appr...
In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefin...
In this work, we study the trade-off between the running time of approximation algorithms and their ...
We improve on random sampling techniques for approximately solving problems that involve cuts in gra...
We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortes...
Graph partitioning problems are a central topic of research in the study of approximation algorithms...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
Given a graph G, the sparsest-cut problem asks to find the set of vertices S which has the least exp...
International audienceIt has long been known, since the classical work of (Arora, Karger, Karpinski,...
We show that the sparsest cut in graphs can be approximated within O(log 2 n) factor in Õ(n3/2) time...
We give a new (1 + ε)-approximation for SPARSEST CUT problem on graphs where small sets expand signi...
We give a new (1 + )-approximation for sparsest cut problem on graphs where small sets expand signif...
We give a O( # log n)-approximation algorithm for sparsest cut, balanced separator, and graph cond...
We give a 2-approximation algorithm for the non-uniform Sparsest Cut problem that runs in time nO(k)...
We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time nO(k), where k is...
In this paper we present two combinatorial algorithms for Sparsest Cut which achieve an O(logn) appr...
In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefin...
In this work, we study the trade-off between the running time of approximation algorithms and their ...
We improve on random sampling techniques for approximately solving problems that involve cuts in gra...
We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortes...
Graph partitioning problems are a central topic of research in the study of approximation algorithms...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
Given a graph G, the sparsest-cut problem asks to find the set of vertices S which has the least exp...
International audienceIt has long been known, since the classical work of (Arora, Karger, Karpinski,...