Embedding tree metrics into low dimensional Euclidean spaces

DOI10.1145/301250.301434zbMath1345.05065OpenAlexW2018799963MaRDI QIDQ2819599

Anupam Gupta

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301434

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Optimal distortion embedding of complete binary trees into lines ⋮ Distortion lower bounds for line embeddings ⋮ On the graph turnpike problem ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$

This page was built for publication: Embedding tree metrics into low dimensional Euclidean spaces