{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:22Z","timestamp":1763467702732},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060665","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"494-503","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Lower-stretch spanning trees"],"prefix":"10.1145","author":[{"given":"Michael","family":"Elkin","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev"}]},{"given":"Yuval","family":"Emek","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}]},{"given":"Daniel A.","family":"Spielman","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA and Akamai Technologies Inc."}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796341"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_7_1","volume-title":"Personal Communication","author":"Bartal Yair","year":"2005","unstructured":"Yair Bartal . Personal Communication , 2005 . Yair Bartal. Personal Communication, 2005."},{"key":"e_1_3_2_1_8_1","volume-title":"Sandia National Lab.","author":"Boman Erik","year":"2001","unstructured":"Erik Boman and Bruce Hendrickson . On spanning tree preconditioners. Manuscript , Sandia National Lab. , 2001 . Erik Boman and Bruce Hendrickson. On spanning tree preconditioners. Manuscript, Sandia National Lab., 2001."},{"key":"e_1_3_2_1_9_1","unstructured":"Erik Boman Bruce Hendrickson and Stephen Vavasis. Solving elliptic finite element systems in near-linear time with support preconditioners. Manuscript Sandia National Lab. and Cornell http:\/\/arXiv.org\/abs\/cs\/0407022.  Erik Boman Bruce Hendrickson and Stephen Vavasis. Solving elliptic finite element systems in near-linear time with support preconditioners. Manuscript Sandia National Lab. and Cornell http:\/\/arXiv.org\/abs\/cs\/0407022."},{"key":"e_1_3_2_1_10_1","volume-title":"A compendium of NP-hard problems. Available online at http:\/\/www.nada.kth.se\/theory\/compendium","author":"Crescenzi P.","year":"1998","unstructured":"P. Crescenzi and V. Kann . A compendium of NP-hard problems. Available online at http:\/\/www.nada.kth.se\/theory\/compendium , 1998 . P. Crescenzi and V. Kann. A compendium of NP-hard problems. Available online at http:\/\/www.nada.kth.se\/theory\/compendium, 1998."},{"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","volume-title":"Computers and Intractability: a Guide to Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson . Computers and Intractability: a Guide to Theory of NP-Completeness . 1979 . M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to Theory of NP-Completeness. 1979."},{"key":"e_1_3_2_1_13_1","first-page":"253","volume-title":"Proceedings of the 9th ACM-SIAM SODA","author":"Garg N.","year":"1998","unstructured":"N. Garg , G. Konjevod , and R. Ravi . A polylogarithmic approximation algorithm for the group steiner tree problem . In Proceedings of the 9th ACM-SIAM SODA , pages 253 -- 259 , 1998 . N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proceedings of the 9th ACM-SIAM SODA, pages 253--259, 1998."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_15_1","first-page":"338","volume-title":"Proceedings of the 11th ACM-SIAM SODA","author":"Konjevod G.","year":"2000","unstructured":"G. Konjevod and R. Ravi . An approximation algorithm for the covering Steiner problem . In Proceedings of the 11th ACM-SIAM SODA , pages 338 -- 344 , 2000 . G. Konjevod and R. Ravi. An approximation algorithm for the covering Steiner problem. In Proceedings of the 11th ACM-SIAM SODA, pages 338--344, 2000."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed Computing: A Locality-Sensitive Approach . 2000 . SIAM Philadelphia PA. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. 2000. SIAM Philadelphia PA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.758833"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200760"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"}],"event":{"name":"STOC05: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Baltimore MD USA","acronym":"STOC05"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:30:47Z","timestamp":1673166647000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":21,"alternative-id":["10.1145\/1060590.1060665","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060665","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}