Coarse differentiation and multi-flows in planar graphs
From MaRDI portal
Publication:848676
DOI10.1007/s00454-009-9172-4zbMath1213.05056OpenAlexW1902724346MaRDI QIDQ848676
James R. Lee, Prasad Raghavendra
Publication date: 4 March 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9172-4
Related Items
A CODING OF BUNDLE GRAPHS AND THEIR EMBEDDINGS INTO BANACH SPACES ⋮ Metric Embedding via Shortest Path Decompositions ⋮ A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time ⋮ On the geometry of the countably branching diamond graphs ⋮ Metric differentiation, monotonicity and maps to \(L^{1}\) ⋮ Metric embeddings of Laakso graphs into Banach spaces ⋮ 𝐿₁-distortion of Wasserstein metrics: A tale of two dimensions ⋮ Cut-sufficient directed 2-commodity multiflow topologies ⋮ Distortion of embeddings of binary trees into diamond graphs ⋮ Lipschitz-free Spaces on Finite Metric Spaces ⋮ Pathwidth, trees, and random embeddings ⋮ A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces ⋮ Coarse differentiation and quantitative nonembeddability for Carnot groups ⋮ Heat flow and quantitative differentiation ⋮ No dimension reduction for doubling subsets of \(\ell_q\) when \(q>2\) revisited ⋮ Analysis on Laakso graphs with application to the structure of transportation cost spaces ⋮ Quantitative affine approximation for UMD targets ⋮ Isometric structure of transportation cost spaces on finite metric spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Quasi-isometries and rigidity of solvable groups
- Differentiating maps into \(L^1\), and the geometry of BV functions
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Carnot-Carathéodory metrics and quasiisometries of symmetric spaces of rank 1
- Multicommodity flows in planar graphs
- Differentiability of Lipschitz functions on metric measure spaces
- Lectures on analysis on metric spaces
- A lower bound on the distortion of embedding planar metrics into Euclidean space
- The geometry of graphs and some of its algorithmic applications
- Nonembeddability theorems via Fourier analysis
- Generalized differentiation and bi-Lipschitz nonembedding in \(L^{1}\)
- Vertex cuts, random walks, and dimension reduction in series-parallel graphs
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- Euclidean distortion and the sparsest cut
- Embedding k-Outerplanar Graphs into l1
- Expander flows, geometric embeddings and graph partitioning
- Geometry of cuts and metrics
- Rectifiability and perimeter in the Heisenberg group
