scientific article

zbMath1302.68276MaRDI QIDQ2934633

Anastasios Sidiropoulos, Mihai Bădoiu, Piotr Indyk

Publication date: 18 December 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (18)

Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs ⋮ The complexity of LSH feasibility ⋮ Unnamed Item ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs ⋮ Using Petal-Decompositions to Build a Low Stretch Spanning Tree ⋮ Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs ⋮ An exact algorithm for minimum distortion embedding ⋮ Slightly Superexponential Parameterized Problems ⋮ Unnamed Item ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ The metric cutpoint partition problem ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees ⋮ Unnamed Item ⋮ 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 ⋮ Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs

This page was built for publication: