$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time

Sanjeev Arora; Elad Hazan; Satyen Kale

doi:10.1137/080731049

$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time

SIAM Journal on Computing ◽

10.1137/080731049 ◽

2010 ◽

Vol 39 (5) ◽

pp. 1748-1771 ◽

Cited By ~ 17

Author(s):

Sanjeev Arora ◽

Elad Hazan ◽

Satyen Kale

Keyword(s):

Sparsest Cut

On the Hardness of Approximating Multicut and Sparsest-Cut

20th Annual IEEE Conference on Computational Complexity (CCC'05) ◽

10.1109/ccc.2005.20 ◽

2005 ◽

Cited By ~ 18

Author(s):

S. Chawla ◽

R. Krauthgamer ◽

R. Kumar ◽

Y. Rabani ◽

D. Sivakumar

Keyword(s):

Sparsest Cut

0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.1 ◽

2004 ◽

Cited By ~ 15

Author(s):

S. Arora ◽

E. Hazan ◽

S. Kale

Keyword(s):

Sparsest Cut

SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-94776-1_57 ◽

2018 ◽

pp. 688-700 ◽

Cited By ~ 1

Author(s):

T.-H. Hubert Chan ◽

Bintao Sun

Keyword(s):

Approximation Algorithms ◽

Primal Dual ◽

Sparsest Cut ◽

Directed Hypergraph

Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2016.03.004 ◽

2016 ◽

Vol 82 (6) ◽

pp. 1044-1063

Author(s):

Mohammad Khairul Hasan ◽

Kyung-Yong Chwa

Keyword(s):

Approximation Algorithms ◽

Graph Partitioning ◽

Partitioning Problems ◽

Sparsest Cut

The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055413 ◽

2017 ◽

Cited By ~ 2

Author(s):

Assaf Naor ◽

Robert Young

Keyword(s):

Constant Multiple ◽

Sdp Relaxation ◽

Integrality Gap ◽

Sparsest Cut

A PRG for lipschitz functions of polynomials with applications to sparsest cut

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488610 ◽

2013 ◽

Cited By ~ 4

Author(s):

Daniel M. Kane ◽

Raghu Meka

Keyword(s):

Lipschitz Functions ◽

Sparsest Cut

Sparsest Cut Approximation Using Single Commodity Flows

SSRN Electronic Journal ◽

10.2139/ssrn.3305748 ◽

2018 ◽

Author(s):

Korbinian Abstreiter

Keyword(s):

Commodity Flows ◽

Sparsest Cut ◽

Single Commodity

Breaking the Multicommodity Flow Barrier for O(√log n)-Approximations to Sparsest Cut

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.66 ◽

2009 ◽

Cited By ~ 17

Author(s):

Jonah Sherman

Keyword(s):

Multicommodity Flow ◽

Sparsest Cut

Sparsest cut on bounded treewidth graphs

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488644 ◽

2013 ◽

Cited By ~ 9

Author(s):

Anupam Gupta ◽

Kunal Talwar ◽

David Witmer

Keyword(s):

Bounded Treewidth ◽

Sparsest Cut

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.40 ◽

2007 ◽

Cited By ~ 21

Author(s):

Christoph Ambuhl ◽

Monaldo Mas ◽

Ola Svensson

Keyword(s):

Linear Arrangement ◽

Optimal Linear ◽

Sparsest Cut ◽

Optimal Linear Arrangement