{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:50:26Z","timestamp":1755838226141,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,8,12]]},"DOI":"10.1145\/1281100.1281110","type":"proceedings-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T23:36:52Z","timestamp":1312414612000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Reconstructing approximate tree metrics"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Hebrew University"}]},{"given":"Mahesh","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"Cornell University"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"ETH Zurich"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Venugopalan","family":"Ramasubramanian","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion","author":"Abraham I.","year":"2006","unstructured":"I. Abraham , Y. Bartal , and O. Neiman . Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion , 2006 . I. Abraham, Y. Bartal, and O. Neiman. Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion, 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795296334"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109563"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_1_5_1","first-page":"253","volume-title":"Proc. of the Symposium on Networked Systems Design and Implementation","author":"Bavier A.","year":"2004","unstructured":"A. Bavier , M. Bowman , B. Chun , D. Culler , S. Karlin , S. Muir , L. Peterson , T. Roscoe , T. Spalink , and M. Wawrzoniak . Operating System Support for Planetary-Scale Network Services . In Proc. of the Symposium on Networked Systems Design and Implementation , pages 253 -- 266 , San Francisco, CA , Mar. 2004 . A. Bavier, M. Bowman, B. Chun, D. Culler, S. Karlin, S. Muir, L. Peterson, T. Roscoe, T. Spalink, and M. Wawrzoniak. Operating System Support for Planetary-Scale Network Services. In Proc. of the Symposium on Networked Systems Design and Implementation, pages 253--266, San Francisco, CA, Mar. 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90047-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/977400.977998"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060665"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780608"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_106"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9586-7_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365448"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875596"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948222"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the ICM","volume":"3","author":"Linial N.","year":"2002","unstructured":"N. Linial . Finite metric spaces-combinatorics, geometry and algorithms . Proceedings of the ICM , Beijing 2002 , vol. 3 , 573--586. N. Linial. Finite metric spaces-combinatorics, geometry and algorithms. Proceedings of the ICM, Beijing 2002, vol. 3, 573--586."},{"key":"e_1_3_2_1_21_1","unstructured":"J. Matou\u0161ek. Open problems on low-distortion embeddings of finite metric spaces 2005. Avaliable in http:\/\/kam.mff.cuni.cz\/ matousek\/metrop.ps.gz.  J. Matou\u0161ek. Open problems on low-distortion embeddings of finite metric spaces 2005. Avaliable in http:\/\/kam.mff.cuni.cz\/ matousek\/metrop.ps.gz."},{"key":"e_1_3_2_1_22_1","volume-title":"Why neighbor-joining works","author":"Mihaescu R.","year":"2006","unstructured":"R. Mihaescu , D. Levy , and L. Pachter . Why neighbor-joining works , 2006 . R. Mihaescu, D. Levy, and L. Pachter. Why neighbor-joining works, 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(200003)33:3%26lt;%26gt;1.0.CO;2-Y"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_26"},{"key":"e_1_3_2_1_26_1","volume-title":"Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete &amp","author":"Rabinovich Y.","year":"1998","unstructured":"Y. Rabinovich and R. Raz . Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete &amp ; Computational Geometry , (19), 1998 . Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete & Computational Geometry, (19), 1998."},{"issue":"4","key":"e_1_3_2_1_27_1","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou N.","year":"1987","unstructured":"N. Saitou , M. Nei , The neighbor-joining method: a new method for reconstructing phylogenetic trees . Mol. Biol. Evol , 4 ( 4 ): 406 -- 425 , 1987 . N. Saitou, M. Nei, et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol, 4(4):406--425, 1987.","journal-title":"Mol. Biol. Evol"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354510"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948223"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of IEEE International Symposium on Network Computing and Applications (NCA)","author":"L.","year":"2004","unstructured":"L. wei Lehman and S. Lerman. Pcoord: Network position estimation using peer-to-peer measurements . In Proc. of IEEE International Symposium on Network Computing and Applications (NCA) , Aug. 2004 . L. wei Lehman and S. Lerman. Pcoord: Network position estimation using peer-to-peer measurements. In Proc. of IEEE International Symposium on Network Computing and Applications (NCA), Aug. 2004."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080103"},{"key":"e_1_3_2_1_32_1","unstructured":"C. Yoshikawa. All-sites-pings for planetlab. http:\/\/ping.ececs.uc.edu\/ping\/ 2006.  C. Yoshikawa. All-sites-pings for planetlab. http:\/\/ping.ececs.uc.edu\/ping\/ 2006."}],"event":{"name":"PODC07: ACM Symposium on Principles of Distributed Computing 2007","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"PODC07"},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281100.1281110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:31Z","timestamp":1750258351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":31,"alternative-id":["10.1145\/1281100.1281110","10.1145\/1281100"],"URL":"https:\/\/doi.org\/10.1145\/1281100.1281110","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}