Pages that link to "Item:Q5115789"
From MaRDI portal
The following pages link to Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (Q5115789):
Displaying 14 items.
- 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)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Random embeddings with an almost Gaussian distortion (Q2125989) (← links)
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces (Q2921660) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Bypassing the embedding (Q3580975) (← links)
- Distortion Is Fixed Parameter Tractable (Q3638056) (← links)
- FPT algorithms for embedding into low complexity graphic metrics (Q5009595) (← links)
- An Exact Algorithm for Minimum Distortion Embedding (Q5851098) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- (Q6062162) (← links)
- (Q6084404) (← links)
