Optimal Average Distortion for Non-Expansive Embeddings of Euclidean Metrics into the Line: With applications to cut-matching games and vertex expansion
cs.DS, cs.CG, math.MG
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain
- Cut-Matching Games on Directed Graphs
- Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles