Pages that link to "Item:Q1380790"
From MaRDI portal
The following pages link to Lower bounds on the distortion of embedding finite metric spaces in graphs (Q1380790):
Displaying 26 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Metric characterizations of superreflexivity in terms of word hyperbolic groups and finite graphs (Q483939) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Nonlinear spectral calculus and super-expanders (Q2249432) (← links)
- Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs (Q2374152) (← links)
- Terminal embeddings (Q2405893) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Metric Characterizations of Some Classes of Banach Spaces (Q2844651) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Distortion of embeddings of binary trees into diamond graphs (Q4595998) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
