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