{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:03Z","timestamp":1787337543304,"version":"build-2736575974"},"reference-count":30,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>This paper addresses the basic question of how well a tree can approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a fundamental problem in network design. We present scaling distortion embeddings where the distortion scales as a function of $\\epsilon$, with the guarantee that for each $\\epsilon$ simultaneously, the distortion of a fraction $1-\\epsilon$ of all pairs is bounded accordingly. Quantitatively, we prove that any finite metric space embeds into an ultrametric with scaling distortion $O(\\sqrt{1\/\\epsilon})$. For the graph setting, we prove that any weighted graph contains a spanning tree with scaling distortion $O(\\sqrt{1\/\\epsilon})$. These bounds are tight even for embedding into arbitrary trees. These results imply that the average distortion of the embedding is constant and that the $\\ell_2$ distortion is $O(\\sqrt{\\log n})$. For probabilistic embedding into spanning trees we prove a scaling distortion of $\\tilde{O}(\\log^2 (1\/\\epsilon))$, which implies constant $\\ell_q$-distortion for every fixed $q&lt;\\infty$.<\/jats:p>","DOI":"10.1137\/120884390","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T13:38:08Z","timestamp":1424266688000},"page":"160-192","source":"Crossref","is-referenced-by-count":3,"title":["Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion"],"prefix":"10.1137","volume":"44","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yair","family":"Bartal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ofer","family":"Neiman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,2,18]]},"reference":[{"key":"atypb1","first-page":"83","author":"Abraham I.","year":"2005","journal-title":"IEEE Computer Society"},{"key":"atypb2","first-page":"271","author":"Abraham I.","year":"2006","journal-title":"New York"},{"key":"atypb3","unstructured":"I. Abraham, Y. Bartal, and O. Neiman,\n                      Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion\n                      , in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 502-511."},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"I. Abraham, Y. Bartal, and O. Neiman, Nearly tight low stretch spanning trees, in Proceedings of the 49th Annual IEEE Symposium on the Foundations of Computer Science, 2008, pp. 781-790.","DOI":"10.1109\/FOCS.2008.62"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"atypb6","first-page":"395","author":"Abraham I.","year":"2012","journal-title":"New York"},{"key":"atypb7","first-page":"288","author":"Athitsos V.","year":"2003","journal-title":"Proceedings of the Gesture Workshop"},{"key":"atypb8","first-page":"184","author":"Bartal Y.","year":"1996","journal-title":"VT"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"Y. Bartal,\n                      On approximating arbitrary metrics by tree metrics\n                      , in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 183-193.","DOI":"10.1145\/276698.276725"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"Y. Bartal,\n                      Graph decomposition lemmas and their role in metric embedding methods\n                      , in 12th Annual European Symposium on Algorithms, 2004, pp. 89-97.","DOI":"10.1007\/978-3-540-30140-0_10"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.008"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.643"},{"key":"atypb13","unstructured":"Y. Bartal and Mendel,\n                      On Low Dimensional Lipschitz Embeddings of Ultrametrics\n                      , manuscript, 2002."},{"key":"atypb14","unstructured":"Y. Bartal and M. Mendel,\n                      Multi-embedding and path approximation of metric spaces\n                      , in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 424-433."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355988"},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"M. Elkin, Y. Emek, D. A. Spielman, and S.H. Teng,\n                      Lower-stretch spanning trees\n                      , in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 494-503.","DOI":"10.1145\/1060590.1060665"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.06.013"},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"J. Fakcharoenphol, S. Rao, and K. Talwar,\n                      A tight bound on approximating arbitrary metrics by tree metrics\n                      , in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 448-455.","DOI":"10.1145\/780542.780608"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1016"},{"key":"atypb20","first-page":"358","author":"Hristescu G.","year":"2000","journal-title":"Proceedings of DaWaK"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446281"},{"key":"atypb22","unstructured":"G. Hjaltason and H. Samet,\n                      Contractive Embedding Methods for Similarity Searching in Metric Spaces\n                      , University of Maryland, College Park, 2000."},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"P. Indyk,\n                      Algorithmic applications of low-distortion geometric embeddings\n                      , in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001, pp. 10-33.","DOI":"10.1109\/SFCS.2001.959878"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289565"},{"key":"atypb25","first-page":"444","author":"Kleinberg J. M.","year":"2004","journal-title":"Proceedings of FOCS"},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"J. B. Kruskal and M. Wish,\n                      Multidimensional Scaling\n                      , SAGE Publications, Thousand Oaks, CA, 1978.","DOI":"10.4135\/9781412985130"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009336"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838597"},{"key":"atypb29","first-page":"63","author":"Tang L.","year":"2004","journal-title":"Proceedings of PAM"},{"key":"atypb30","first-page":"21","author":"Wu B. Y.","year":"1998","journal-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/120884390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:16:35Z","timestamp":1787336195000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/120884390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/120884390"],"URL":"https:\/\/doi.org\/10.1137\/120884390","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}