The following pages link to (Q2934633):
Displaying 18 items.
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← 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)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- The metric cutpoint partition problem (Q734378) (← links)
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs (Q2349859) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees (Q5075834) (← links)
- (Q5088977) (← links)
- (Q5115789) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- (Q6062162) (← links)
