Pages that link to "Item:Q3581393"
From MaRDI portal
The following pages link to Low-distortion embeddings of general metrics into the line (Q3581393):
Displaying 23 items.
- Optimal distortion embedding of complete binary trees into lines (Q436329) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Distortion lower bounds for line embeddings (Q975439) (← links)
- On the graph turnpike problem (Q989483) (← links)
- Filament plots for data visualization (Q2155802) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- (Q5009595) (← links)
- (Q5115789) (← links)
- (Q5136231) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- (Q6062162) (← links)
- (Q6084404) (← links)
