{"id":"https://openalex.org/W2022973561","doi":"https://doi.org/10.1137/090758039","title":"Fault Tolerant Spanners for General Graphs","display_name":"Fault Tolerant Spanners for General Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2022973561","doi":"https://doi.org/10.1137/090758039","mag":"2022973561"},"language":"en","primary_location":{"id":"doi:10.1137/090758039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090758039","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/A5066485203","display_name":"Shiri Chechik","orcid":"https://orcid.org/0009-0008-7909-7883"},"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":true,"raw_author_name":"S. Chechik","raw_affiliation_strings":["shiri.chechik@weizmann.ac.il and david.peleg@weizmann.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"shiri.chechik@weizmann.ac.il and david.peleg@weizmann.ac.il#TAB#","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011741113","display_name":"Michael Langberg","orcid":"https://orcid.org/0000-0002-7470-0718"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Langberg","raw_affiliation_strings":["mikel@openu.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"mikel@openu.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Peleg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076616592","display_name":"Liam Roditty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. Roditty","raw_affiliation_strings":["liamr@macs.biu.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"liamr@macs.biu.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066485203"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":1.3381,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.80188898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"7","first_page":"3403","last_page":"3423"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.9786233901977539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7836070656776428},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6579210162162781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195549130439758},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5093463659286499},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.487148255109787},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4150252640247345},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4138734042644501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3869324326515198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2837996184825897}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9786233901977539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7836070656776428},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6579210162162781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195549130439758},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5093463659286499},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.487148255109787},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4150252640247345},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4138734042644501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3869324326515198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2837996184825897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090758039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090758039","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":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1965127928","https://openalex.org/W1987669032","https://openalex.org/W1989169588","https://openalex.org/W1997973101","https://openalex.org/W2002041206","https://openalex.org/W2018963243","https://openalex.org/W2045446569","https://openalex.org/W2055488252","https://openalex.org/W2091569826","https://openalex.org/W2106110423","https://openalex.org/W2143858321","https://openalex.org/W2157760787","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W4297623464","https://openalex.org/W2162831161","https://openalex.org/W2993304180","https://openalex.org/W4287999588","https://openalex.org/W3082881870","https://openalex.org/W2033607935","https://openalex.org/W4237934402","https://openalex.org/W2081672443","https://openalex.org/W2608700661"],"abstract_inverted_index":{"This":[0,143],"paper":[1,144,172],"concerns":[2],"graph":[3,86,277],"spanners":[4,43,238],"that":[5,208],"are":[6,270],"resistant":[7],"to":[8,21,35,158,272],"vertex":[9,266],"or":[10],"edge":[11,249,264],"failures.":[12],"In":[13,227],"the":[14,50,63,85,107,151,177,190,193,198,201,211,215,231,275],"failure-free":[15],"setting,":[16],"it":[17,155],"is":[18,33,78,156,279],"known":[19],"how":[20],"efficiently":[22],"construct":[23],"a":[24,46,160,206],"$(2k-1)$-spanner":[25,184,247],"of":[26,40,62,70,84,94,102,153,185,192,200,217,234,251],"size":[27,95,186,199,252],"$O(n^{1+1/k})$,":[28],"and":[29,57,99,125,133,221,265],"this":[30,174],"size-stretch":[31],"trade-off":[32],"conjectured":[34],"be":[36],"tight.":[37],"The":[38,170],"notion":[39],"fault":[41,81,117,161,182,236,245],"tolerant":[42,82,118,162,183,237,246],"was":[44,128],"introduced":[45],"decade":[47],"ago":[48],"in":[49,60,109,130,176,225],"geometric":[51,119],"setting":[52,233],"[C.":[53],"Levcopoulos,":[54],"G.":[55],"Narasimhan,":[56],"M.":[58],"Smid,":[59],"Proceedings":[61],"30th":[64],"Annual":[65],"ACM":[66],"Symposium":[67],"on":[68,210,214,222],"Theory":[69],"Computing,":[71],"1998,":[72],"pp.":[73,141],"186\u2013195].":[74],"A":[75,116],"subgraph":[76],"H":[77,110],"an":[79,148,165,180,243],"f-vertex":[80,181],"k-spanner":[83],"G":[87,278],"if":[88],"for":[89,164],"any":[90,100],"set":[91,250],"$F\\subseteq":[92],"V$":[93],"at":[96],"most":[97],"f":[98,256],"pair":[101],"vertices":[103],"$u,v\\in":[104],"V\\setminus":[105],"F$,":[106],"distances":[108],"satisfy":[111],"$\\delta_{H\\setminus":[112],"F}(u,v)\\leq":[113],"k\\cdot\\delta_{G\\setminus":[114],"F}(u,v)$.":[115],"spanner":[120,163,194,202],"with":[121,248],"optimal":[122],"maximum":[123],"degree":[124],"total":[126],"weight":[127],"presented":[129],"[A.":[131],"Czumaj":[132],"H.":[134],"Zhao,":[135],"Discrete":[136],"Comput.":[137],"Geom.,":[138],"32":[139],"(2004),":[140],"207\u2013230].":[142],"also":[145],"raised":[146],"as":[147],"open":[149],"problem":[150],"question":[152,175],"whether":[154],"possible":[157],"obtain":[159],"arbitrary":[166],"undirected":[167],"weighted":[168],"graph.":[169],"current":[171],"answers":[173],"affirmative,":[178],"presenting":[179],"$O(f^{2}k^{f+1}\\cdot":[187],"n^{1+1/k}\\log^{1-1/k}n)$.":[188],"Interestingly,":[189],"stretch":[191,212],"remains":[195],"unchanged,":[196],"while":[197],"increases":[203],"only":[204],"by":[205],"factor":[207],"depends":[209],"k,":[213],"number":[216],"potential":[218],"faults":[219],"f,":[220],"logarithmic":[223],"terms":[224],"n.":[226],"addition,":[228],"we":[229],"consider":[230],"simpler":[232],"f-edge":[235,244],"(defined":[239],"analogously).":[240],"We":[241],"present":[242],"$O(f\\cdot":[253],"n^{1+1/k})$":[254],"(only":[255],"times":[257],"larger":[258],"than":[259],"standard":[260],"spanners).":[261],"For":[262],"both":[263],"faults,":[267],"our":[268],"results":[269],"shown":[271],"hold":[273],"when":[274],"given":[276],"weighted.":[280]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}