Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Journal of Combinatorial Theory Series B
Lectures on Discrete Geometry
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Cuts, Trees and ℓ1-Embeddings of Graphs*
Combinatorica
Embedding k-Outerplanar Graphs into l1
SIAM Journal on Discrete Mathematics
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Randomly removing g handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Randomly removing g handles at once
Computational Geometry: Theory and Applications
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Vertex sparsifiers: new results from old techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A node-capacitated okamura-seymour theorem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the 2-sum embedding conjecture
Proceedings of the twenty-ninth annual symposium on Computational geometry
Pathwidth, trees, and random embeddings
Combinatorica
Hi-index | 0.00 |
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture to a pair of manifestly simpler conjectures. The GNRS conjecture characterizes all graphs that have an O(1)-approximate multi-commodity max-flow/min-cut theorem. In particular, its resolution would imply a constant factor approximation for the general Sparsest Cut problem in every family of graphs which forbids some minor. In the course of our study, we prove a number of results of independent interest.