Approximation algorithms for embedding general metrics into trees
From MaRDI portal
Recommendations
- Low-distortion embeddings of general metrics into the line
- A tight bound on approximating arbitrary metrics by tree metrics
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation algorithms for minimizing average distortion
Cited in
(42)- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
- Satisfying general proximity/similarity queries with metric trees
- On approximating planar metrics by tree metrics.
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Approximation algorithms for minimizing average distortion
- The complexity of LSH feasibility
- Embedding tree metrics into low dimensional Euclidean spaces
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- Combinatorial theorems about embedding trees on the real line
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- scientific article; zbMATH DE number 3866594 (Why is no real title available?)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
- scientific article; zbMATH DE number 1222844 (Why is no real title available?)
- scientific article; zbMATH DE number 2079366 (Why is no real title available?)
- scientific article; zbMATH DE number 2079367 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- Parallel metric tree embedding based on an algebraic view on Moore-Bellman-Ford
- Using petal-decompositions to build a low stretch spanning tree
- Tree metrics and edge-disjoint \(S\)-paths
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- Algorithms for metric learning via contrastive embeddings
- scientific article; zbMATH DE number 7204478 (Why is no real title available?)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- Viewing the rings of a tree: minimum distortion embeddings into trees
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- STACS 2004
- Reconstructing approximate tree metrics
- An exact algorithm for minimum distortion embedding
- Slightly superexponential parameterized problems
- A tight bound on approximating arbitrary metrics by tree metrics
- A tight bound on approximating arbitrary metrics by tree metrics
- scientific article; zbMATH DE number 7758338 (Why is no real title available?)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- Bicriteria approximation for minimum dilation graph augmentation
- The metric cutpoint partition problem
This page was built for publication: Approximation algorithms for embedding general metrics into trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934633)
