Pages that link to "Item:Q2921660"
From MaRDI portal
The following pages link to Approximation algorithms for low-distortion embeddings into low-dimensional spaces (Q2921660):
Displaying 34 items.
- Bandwidth and distortion revisited (Q412348) (← links)
- Optimal distortion embedding of complete binary trees into lines (Q436329) (← 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)
- 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)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Estimating the optimal margins of embeddings in Euclidean half spaces (Q1394789) (← links)
- Random embeddings with an almost Gaussian distortion (Q2125989) (← links)
- Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← 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)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (Q3512470) (← links)
- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics (Q3540227) (← links)
- Bypassing the embedding (Q3580975) (← links)
- (Q4633899) (← links)
- FPT algorithms for embedding into low complexity graphic metrics (Q5009595) (← links)
- FPT Algorithms for Embedding into Low-Complexity Graphic Metrics (Q5053040) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (Q5115789) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q5136231) (← links)
- STACS 2004 (Q5309703) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313050) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- (Q6062162) (← links)
- (Q6084404) (← links)
