Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
From MaRDI portal
Publication:5115789
Recommendations
- Distortion Is Fixed Parameter Tractable
- Distortion is fixed parameter tractable
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Low-distortion embeddings of general metrics into the line
Cites work
- scientific article; zbMATH DE number 5506208 (Why is no real title available?)
- scientific article; zbMATH DE number 1789916 (Why is no real title available?)
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- A robust model for finding optimal evolutionary trees
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- Approximation algorithms for embedding general metrics into trees
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Distortion Is Fixed Parameter Tractable
- Distortion is fixed parameter tractable
- Euclidean distortion and the sparsest cut
- Expander flows, geometric embeddings and graph partitioning
- Fat polygonal partitions with applications to visualization and embeddings
- Hardness of Embedding Metric Spaces of Equal Size
- Improved algorithms for optimal embeddings
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Inapproximability for planar embedding problems
- Low Distortion Maps Between Point Sets
- Low distortion maps between point sets
- Low-distortion embeddings of general metrics into the line
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- The complexity of low-distortion embeddings between point sets
- The geometry of graphs and some of its algorithmic applications
Cited in
(21)- Hardness and approximation of minimum distortion embeddings
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Bypassing the embedding
- An exact algorithm for minimum distortion embedding
- Metric embedding via shortest path decompositions
- Distortion is fixed parameter tractable
- An exact algorithm for minimum distortion embedding
- Random embeddings with an almost Gaussian distortion
- scientific article; zbMATH DE number 7758338 (Why is no real title available?)
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Distortion Is Fixed Parameter Tractable
- Light Euclidean Spanners with Steiner Points
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- FPT algorithms for embedding into low complexity graphic metrics
- \(\ell _{1}\)-embeddability of 2-dimensional \(\ell _{1}\)-rigid periodic graphs
- Line-distortion, bandwidth and path-length of a graph
- Line-distortion, bandwidth and path-length of a graph
- Improved algorithms for optimal embeddings
This page was built for publication: Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115789)
