Publication:2934632
From MaRDI portal
zbMath1302.68271MaRDI QIDQ2934632
Ittai Abraham, Ofer Neiman, Yair Bartal
Publication date: 18 December 2014
05C05: Trees
54E35: Metric spaces, metrizability
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C12: Distance in graphs
Related Items
Using Petal-Decompositions to Build a Low Stretch Spanning Tree, Lower bounds for strictly fundamental cycle bases in grid graphs, Tropical Sufficient Statistics for Persistent Homology, Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion, An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner, Advances in metric embedding theory, Local embeddings of metric spaces, Cycle bases in graphs characterization, algorithms, complexity, and applications, Volume in general metric spaces, Finding the closest ultrametric, The metric cutpoint partition problem, An improved algorithm for computing all the best swap edges of a tree spanner, Average stretch factor: how low does it go?, New length bounds for cycle bases, Prioritized Metric Structures and Embedding, A Faster Computation of All the Best Swap Edges of a Tree Spanner