Approximation algorithms for low-distortion embeddings into low-dimensional spaces
From MaRDI portal
Recommendations
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- scientific article; zbMATH DE number 2079367
- An exact algorithm for minimum distortion embedding
- An exact algorithm for minimum distortion embedding
- Hardness and approximation of minimum distortion embeddings
- The complexity of low-distortion embeddings between point sets
- Bypassing the embedding
- Space lower bounds for low-stretch greedy embeddings
Cited in
(40)- A linear-space algorithm for distance preserving graph embedding
- Estimating the optimal margins of embeddings in Euclidean half spaces
- Random embeddings with an almost Gaussian distortion
- Characterizing graphs with convex and connected Cayley configuration spaces
- On the minimum eccentricity shortest path problem
- The complexity of LSH feasibility
- Approximation algorithms for embedding general metrics into trees
- Combinatorial theorems about embedding trees on the real line
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- On the minimum eccentricity shortest path problem
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
- Bypassing the embedding
- Hardness of Embedding Metric Spaces of Equal Size
- Bandwidth and distortion revisited
- Optimal distortion embedding of complete binary trees into lines
- scientific article; zbMATH DE number 2079367 (Why is no real title available?)
- scientific article; zbMATH DE number 7051256 (Why is no real title available?)
- FPT algorithms for embedding into low complexity graphic metrics
- FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
- Retracting Graphs to Cycles
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- Decomposing a graph into shortest paths with bounded eccentricity
- Line-distortion, bandwidth and path-length of a graph
- Viewing the rings of a tree: minimum distortion embeddings into trees
- STACS 2004
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- An exact algorithm for minimum distortion embedding
- Slightly superexponential parameterized problems
- scientific article; zbMATH DE number 7758338 (Why is no real title available?)
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Two-sided Kirszbraun theorem
- Decomposing a graph into shortest paths with bounded eccentricity
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Distortion lower bounds for line embeddings
- Hardness and approximation of minimum distortion embeddings
This page was built for publication: Approximation algorithms for low-distortion embeddings into low-dimensional spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921660)
