{"id":"https://openalex.org/W2569942321","doi":"https://doi.org/10.1137/050641661","title":"Lower-Stretch Spanning Trees","display_name":"Lower-Stretch Spanning Trees","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2569942321","doi":"https://doi.org/10.1137/050641661","mag":"2569942321"},"language":"en","primary_location":{"id":"doi:10.1137/050641661","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050641661","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["elkinm@cs.bgu.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"elkinm@cs.bgu.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["yuval.emek@weizmann.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"yuval.emek@weizmann.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["spielman@cs.yale.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"spielman@cs.yale.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.0538,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.98552444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"38","issue":"2","first_page":"608","last_page":"628"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.827400803565979},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.8014952540397644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7829841375350952},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7793987393379211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6779786944389343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5468806624412537},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46942073106765747},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.43001365661621094},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.429133802652359},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1996265947818756}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.827400803565979},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.8014952540397644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7829841375350952},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7793987393379211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6779786944389343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5468806624412537},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46942073106765747},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.43001365661621094},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.429133802652359},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1996265947818756},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050641661","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050641661","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1981859328","https://openalex.org/W2040831377","https://openalex.org/W2041571997","https://openalex.org/W2043520568","https://openalex.org/W2045107949","https://openalex.org/W2047517090","https://openalex.org/W2059063102","https://openalex.org/W2082353536","https://openalex.org/W2092534058","https://openalex.org/W2114493937","https://openalex.org/W2150148016","https://openalex.org/W2530398396"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2113270940","https://openalex.org/W1992470151","https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W2521054645","https://openalex.org/W2113623403","https://openalex.org/W2018076478","https://openalex.org/W2887154986"],"abstract_inverted_index":{"We":[0],"show":[1,35],"that":[2,36,144],"every":[3],"weighted":[4],"connected":[5],"graph":[6,64,76],"G":[7,20],"contains":[8],"as":[9],"a":[10,12,74],"subgraph":[11],"spanning":[13,147],"tree":[14,38],"into":[15],"which":[16],"the":[17,62,88,92,128],"edges":[18],"of":[19,91,101],"can":[21,39,82,134],"be":[22,40,83,136],"embedded":[23],"with":[24],"average":[25],"stretch":[26],"$O":[27,44,57,119],"(\\log^{2}":[28],"n":[29,47,49,121,123],"\\log":[30,31,46,59,124,125],"n)$.":[32],"Moreover,":[33],"we":[34],"this":[37],"constructed":[41],"in":[42,52,55,70],"time":[43,56,90],"(m":[45,58],"+":[48],"\\log^2":[50],"n)$":[51,60,126],"general,":[53],"and":[54,103,117],"if":[61],"input":[63],"is":[65,73,130],"unweighted.":[66],"The":[67],"main":[68],"ingredient":[69],"our":[71],"construction":[72],"novel":[75],"decomposition":[77],"technique.":[78],"Our":[79,132],"new":[80],"algorithm":[81],"immediately":[84],"used":[85,137],"to":[86,113,118,138],"improve":[87,139],"running":[89],"recent":[93],"solver":[94],"for":[95],"symmetric":[96],"diagonally":[97],"dominant":[98],"linear":[99],"systems":[100],"Spielman":[102],"Teng":[104],"from":[105],"$":[106],"m":[107],"2^{(O":[108],"(\\sqrt{\\log":[109],"n\\log\\log":[110],"n}))":[111],"}$":[112],"$m":[114],"\\log^{O":[115],"(1)}n$,":[116],"(":[120],"\\log^{2}":[122],"when":[127],"system":[129],"planar.":[131],"result":[133],"also":[135],"several":[140],"earlier":[141],"approximation":[142],"algorithms":[143],"use":[145],"low-stretch":[146],"trees.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}