scientific article; zbMATH DE number 6381679

zbMATH Open1302.68276MaRDI QIDQ2934633FDOQ2934633

Anastasios Sidiropoulos, Piotr Indyk, Mihai Bădoiu

Publication date: 18 December 2014

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Distance in graphs (05C12) Metric spaces, metrizability (54E35)

Cited In (26)

• Slightly Superexponential Parameterized Problems
• Title not available (Why is that?)
• The complexity of LSH feasibility
• Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
• An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
• An exact algorithm for minimum distortion embedding
• The metric cutpoint partition problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Using Petal-Decompositions to Build a Low Stretch Spanning Tree
• 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
• Title not available (Why is that?)
• Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
• A tight bound on approximating arbitrary metrics by tree metrics
• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Tree metrics and edge-disjoint \(S\)-paths
• Satisfying general proximity/similarity queries with metric trees
• Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• Title not available (Why is that?)
• Inapproximability for metric embeddings into $\mathbb{R}^{d}$
• Title not available (Why is that?)
• Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces
• On approximating planar metrics by tree metrics.
• Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934633)