{"id":"https://openalex.org/W1978086920","doi":"https://doi.org/10.1145/1060590.1060665","title":"Lower-stretch spanning trees","display_name":"Lower-stretch spanning trees","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W1978086920","doi":"https://doi.org/10.1145/1060590.1060665","mag":"1978086920"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060665","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev","Ben Gurion University of the Negev"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["Boston University, Boston, MA and Akamai Technologies Inc","Boston University, Boston, MA and Akamai Technologies Inc.#TAB#"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA and Akamai Technologies Inc","institution_ids":[]},{"raw_affiliation_string":"Boston University, Boston, MA and Akamai Technologies Inc.#TAB#","institution_ids":["https://openalex.org/I10734018"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":12.1196,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.99207949,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"494","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8372063040733337},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7337252497673035},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.721031129360199},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6259660720825195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5628972053527832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5576208829879761},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5486522316932678},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5418288707733154},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4891086220741272},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47037190198898315},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.427230566740036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3462860882282257},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.22032180428504944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21838486194610596},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11519050598144531}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8372063040733337},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7337252497673035},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.721031129360199},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6259660720825195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5628972053527832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5576208829879761},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5486522316932678},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5418288707733154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4891086220741272},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47037190198898315},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.427230566740036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3462860882282257},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.22032180428504944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21838486194610596},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11519050598144531},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/1060590.1060665","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.2012","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.2012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~pettie/theoryseminar/papers/Elkin-etal-low-stretch-spanning-tree.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.5435","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~yuvale/Publications/lsst.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.2871","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.2871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/~elkinm/av_stretch_trees.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.6177","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/~elkinm/lsst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.3715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/~elkinm/sicomp_final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.7432","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.7432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0411064v4.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1487344286","https://openalex.org/W1518157041","https://openalex.org/W1568961751","https://openalex.org/W1963055884","https://openalex.org/W1966878439","https://openalex.org/W1967520142","https://openalex.org/W1981859328","https://openalex.org/W1984040953","https://openalex.org/W1991626387","https://openalex.org/W2011039300","https://openalex.org/W2040831377","https://openalex.org/W2041571997","https://openalex.org/W2043520568","https://openalex.org/W2045107949","https://openalex.org/W2047517090","https://openalex.org/W2049184889","https://openalex.org/W2059063102","https://openalex.org/W2073772681","https://openalex.org/W2082353536","https://openalex.org/W2092534058","https://openalex.org/W2107881198","https://openalex.org/W2114493937","https://openalex.org/W2133156969","https://openalex.org/W2149929647","https://openalex.org/W2150148016","https://openalex.org/W2176446742","https://openalex.org/W2530398396","https://openalex.org/W3186546642","https://openalex.org/W4205300528"],"related_works":["https://openalex.org/W3123513344","https://openalex.org/W2378329589","https://openalex.org/W2096249258","https://openalex.org/W2014331195","https://openalex.org/W2950050988","https://openalex.org/W4307117475","https://openalex.org/W2750772825","https://openalex.org/W1870020915","https://openalex.org/W2018076478","https://openalex.org/W1994823003"],"abstract_inverted_index":{"We":[0],"show":[1,35],"that":[2,36,131],"every":[3],"weighted":[4],"connected":[5],"graph":[6,58,70],"G":[7,20],"contains":[8],"as":[9],"a":[10,12,68],"subgraph":[11],"spanning":[13,134],"tree":[14,38],"into":[15],"which":[16],"the":[17,56,81,85,115],"edges":[18],"of":[19,84,94],"can":[21,39,75,121],"be":[22,40,76,123],"embedded":[23],"with":[24],"average":[25],"stretch":[26],"O":[27,44,52,108],"(log2":[28],"n":[29],"log":[30,31,100,104,111,112],"n).":[32],"Moreover,":[33],"we":[34],"this":[37],"constructed":[41],"in":[42,47,50,64],"time":[43,51,83],"(m":[45],"log2n)":[46],"general,":[48],"and":[49,96,106],"(mlog":[53],"n)":[54,101,113],"if":[55],"input":[57],"is":[59,67,117],"unweighted.":[60],"The":[61],"main":[62],"ingredient":[63],"our":[65],"construction":[66],"novel":[69],"decomposition":[71],"technique.Our":[72],"new":[73],"algorithm":[74],"immediately":[77],"used":[78,124],"to":[79,102,107,125],"improve":[80,126],"running":[82],"recent":[86],"solver":[87],"for":[88],"symmetric":[89],"diagonally":[90],"dominant":[91],"linear":[92],"systems":[93],"Spielman":[95],"Teng":[97],"from":[98],"m2(O\u221alognlog":[99],"m":[103],"O(1)n":[105],"(n":[109],"log2n":[110],"when":[114],"system":[116],"planar.":[118],"Our":[119],"result":[120],"also":[122],"several":[127],"earlier":[128],"approximation":[129],"algorithms":[130],"use":[132],"low-stretch":[133],"trees.":[135]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}