Viewing the rings of a tree: minimum distortion embeddings into trees

DOI10.1137/1.9781611975482.146MaRDI QIDQ5236333zbMATH OpenOpenAlexFDO

Authors Amir Nayyeri, Benjamin Raichel

Publication date 15 October 2019

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

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)

Recommendations

• A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
• Approximation algorithms for embedding general metrics into trees
• scientific article; zbMATH DE number 1775401
• Approximation algorithms for low-distortion embeddings into low-dimensional spaces
• Embedding tree metrics into low dimensional Euclidean spaces

Cited in

(6)

• Circular partitions with applications to visualization and embeddings
• Covering Metric Spaces by Few Trees
• A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
• Light Euclidean Spanners with Steiner Points
• On notions of distortion and an almost minimum spanning tree with constant average distortion
• On notions of distortion and an almost minimum spanning tree with constant average distortion

This page was built for publication: Viewing the rings of a tree: minimum distortion embeddings into trees

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