Combinatorica
SIAM Journal on Computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Lectures on Discrete Geometry
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n2) Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An improved approximation ratio for the minimum linear arrangement problem
Information Processing Letters
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Connectivity oracles for failure prone graphs
Proceedings of the forty-second ACM symposium on Theory of computing
The little engine(s) that could: scaling online social networks
Proceedings of the ACM SIGCOMM 2010 conference
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Determining edge expansion and other connectivity measures of graphs of bounded genus
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An algorithm for the graph crossing number problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A tighter insertion-based approximation of the crossing number
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the complexity of isoperimetric problems on trees
Discrete Applied Mathematics
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Overlapping clusters for distributed computation
Proceedings of the fifth ACM international conference on Web search and data mining
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
Streaming graph partitioning for large distributed graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Local Versus Global Properties of Metric Spaces
SIAM Journal on Computing
Unsupervised sparse matrix co-clustering for marketing and sales intelligence
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
The little engine(s) that could: scaling online social networks
IEEE/ACM Transactions on Networking (TON)
Detecting Probabilistic Community with Topic Modeling on Sampling SubGraphs
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
d-dimensional arrangement revisited
Information Processing Letters
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
| Hi-index | 0.00 |
We give a O(&sqrt;log n)-approximation algorithm for the sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural “approximate certificate” for a graph's expansion, which involves embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.