On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion

DOI10.1137/1.9781611974331.ch62zbMath1410.68276OpenAlexW2949625395MaRDI QIDQ4575641

Ofer Neiman, Arnold Filtser, Yair Bartal

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch62

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (5)

Terminal embeddings ⋮ Lossless Prioritized Embeddings ⋮ Prioritized Metric Structures and Embedding ⋮ Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm ⋮ On notions of distortion and an almost minimum spanning tree with constant average distortion

This page was built for publication: On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion