{"id":"https://openalex.org/W1764866826","doi":"https://doi.org/10.1137/13094791x","title":"Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones","display_name":"Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1764866826","doi":"https://doi.org/10.1137/13094791x","mag":"1764866826"},"language":"en","primary_location":{"id":"doi:10.1137/13094791x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/13094791x","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":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shay Solomon","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8192,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.85343583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"44","issue":"4","first_page":"996","last_page":"1025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9990000128746033,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7072510719299316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.691800594329834},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6233479976654053},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4896565079689026},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4791352450847626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4614289104938507},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4604755938053131},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.45390641689300537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43173205852508545},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4304421544075012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40535932779312134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37295985221862793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34613174200057983},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14794448018074036}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7072510719299316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.691800594329834},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6233479976654053},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4896565079689026},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4791352450847626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4614289104938507},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4604755938053131},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.45390641689300537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43173205852508545},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4304421544075012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40535932779312134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37295985221862793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34613174200057983},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14794448018074036},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/13094791x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/13094791x","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.7244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.7244","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/~shayso/Papers/FOCS11.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/W1963524245","https://openalex.org/W1969939844","https://openalex.org/W1975752629","https://openalex.org/W1977712294","https://openalex.org/W1979740015","https://openalex.org/W1981859328","https://openalex.org/W2002041206","https://openalex.org/W2003882909","https://openalex.org/W2005128841","https://openalex.org/W2009976792","https://openalex.org/W2020284736","https://openalex.org/W2034112563","https://openalex.org/W2055891819","https://openalex.org/W2059707428","https://openalex.org/W2060919812","https://openalex.org/W2070664846","https://openalex.org/W2082352769","https://openalex.org/W2086709935","https://openalex.org/W2090643701","https://openalex.org/W2098907131","https://openalex.org/W2099831016","https://openalex.org/W2107711372","https://openalex.org/W2112210934","https://openalex.org/W2144677702","https://openalex.org/W2151250580","https://openalex.org/W2152950844","https://openalex.org/W2569942321","https://openalex.org/W4240753356","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W3047993683","https://openalex.org/W1868361628","https://openalex.org/W4301018421","https://openalex.org/W2074881724","https://openalex.org/W3194189065","https://openalex.org/W4327524512","https://openalex.org/W1971779258","https://openalex.org/W836113","https://openalex.org/W2294107416","https://openalex.org/W2412875519"],"abstract_inverted_index":{"For":[0],"a":[1,8,13,33,53,95,267],"pair":[2],"of":[3,12,28,55,68,74,87,139,147,157,165,185,221],"parameters":[4,146],"$\\alpha,\\beta":[5],"\\ge":[6],"1$,":[7],"spanning":[9,71,253],"tree":[10,25,72,89,269],"$T$":[11],"weighted":[14],"undirected":[15],"$n$-vertex":[16],"graph":[17,97],"$G":[18],"=":[19,216,244,262],"(V,E,w)$":[20],"is":[21,61,81],"called":[22,82],"an":[23,249],"$(\\alpha,\\beta)$-shallow-light":[24],"(shortly,":[26],"$(\\alpha,\\beta)$-SLT)":[27],"$G$":[29],"with":[30,99,239,270],"respect":[31],"to":[32,47,52,293],"designated":[34],"vertex":[35],"$rt":[36],"\\in":[37],"V$":[38],"if":[39],"(1)":[40],"it":[41],"approximates":[42],"all":[43,287],"distances":[44],"from":[45],"$rt$":[46],"the":[48,66,69,83,88,136,145,158,186,212,219,259],"other":[49],"vertices":[50],"up":[51,292],"factor":[54],"$\\alpha$,":[56],"and":[57,102,123,128,134,154,174,179,182,210,255],"(2)":[58],"its":[59],"weight":[60,67,271],"at":[62,272],"most":[63,273],"$\\beta$":[64],"times":[65],"minimum":[70],"$MST(G)$":[73],"$G$.":[75],"The":[76],"parameter":[77],"$\\alpha$":[78],"(resp.,":[79,85],"$\\beta$)":[80],"root-distortion":[84],"lightness)":[86],"$T$.":[90],"Shallow-light":[91],"trees":[92],"(SLTs)":[93],"constitute":[94],"fundamental":[96],"structure,":[98],"numerous":[100],"theoretical":[101],"practical":[103],"applications.":[104],"In":[105,226,258],"particular,":[106],"they":[107],"were":[108,149],"used":[109],"for":[110,116,119,201],"constructing":[111],"spanners":[112],"in":[113,126,131,135],"network":[114],"design,":[115,118],"VLSI-circuit":[117],"various":[120],"data":[121],"gathering":[122],"dissemination":[124],"tasks":[125],"wireless":[127],"sensor":[129],"networks,":[130,133],"overlay":[132],"message-passing":[137],"model":[138],"distributed":[140],"computing.":[141],"Tight":[142],"tradeoffs":[143],"between":[144,252],"SLTs":[148,222,238,254],"established":[150],"by":[151],"Awerbuch,":[152],"Baratz,":[153],"Peleg":[155],"[Proceedings":[156,184],"9th":[159],"Annual":[160,188],"ACM":[161],"Symposium":[162,190],"on":[163,191,218],"Principles":[164],"Distributed":[166],"Computing":[167],"(PODC),":[168],"1990,":[169],"pp.":[170,196],"177--187,":[171],"Efficient":[172],"Broadcast":[173],"Light-Weight":[175],"Spanners,":[176],"manuscript,":[177],"1991]":[178],"Khuller,":[180],"Raghavachari,":[181],"Young":[183],"Fourth":[187],"ACM-SIAM":[189],"Discrete":[192],"Algorithms":[193],"(SODA),":[194],"1993,":[195],"243--250].":[197],"They":[198],"showed":[199],"that":[200,211,231,284,286],"any":[202],"$\\epsilon":[203,261],">":[204],"0$":[205,263],"there":[206],"always":[207],"exist":[208],"$(1+\\epsilon,O(\\frac{1}{\\epsilon}))$-SLTs":[209],"upper":[213],"bound":[214],"$\\beta":[215,243],"O(\\frac{1}{\\epsilon})$":[217],"lightness":[220],"cannot":[223],"be":[224],"improved.":[225],"this":[227],"paper":[228],"we":[229,279],"show":[230,285],"using":[232],"Steiner":[233,256],"points":[234],"one":[235],"can":[236],"build":[237],"logarithmic":[240],"lightness,":[241],"i.e.,":[242],"O(\\log":[245],"\\frac{1}{\\epsilon})$.":[246],"This":[247],"establishes":[248],"exponential":[250],"separation":[251],"ones.":[257],"regime":[260],"our":[264,288],"construction":[265],"provides":[266],"shortest-path":[268],"$O(\\log":[274],"n)":[275],"\\cdot":[276],"w(MST(G))$.":[277],"Moreover,":[278],"prove":[280],"matching":[281],"lower":[282],"bounds":[283],"results":[289],"are":[290],"tight":[291],"constant":[294],"factors.":[295]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}