{"id":"https://openalex.org/W3008435726","doi":"https://doi.org/10.1145/3382734.3405735","title":"Efficient and Simple Algorithms for Fault-Tolerant Spanners","display_name":"Efficient and Simple Algorithms for Fault-Tolerant Spanners","publication_year":2020,"publication_date":"2020-07-31","ids":{"openalex":"https://openalex.org/W3008435726","doi":"https://doi.org/10.1145/3382734.3405735","mag":"3008435726"},"language":"en","primary_location":{"id":"doi:10.1145/3382734.3405735","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405735","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405735","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405735","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087150923","display_name":"Caleb Robelle","orcid":null},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Caleb Robelle","raw_affiliation_strings":["University of Maryland, Baltimore County","University of Maryland,Baltimore County"],"affiliations":[{"raw_affiliation_string":"University of Maryland, Baltimore County","institution_ids":["https://openalex.org/I79272384"]},{"raw_affiliation_string":"University of Maryland,Baltimore County","institution_ids":["https://openalex.org/I79272384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":0.2886,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6068636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"493","last_page":"500"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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.9861999750137329,"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/fault-tolerance","display_name":"Fault tolerance","score":0.6901429891586304},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6823666095733643},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6613399982452393},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6352429986000061},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6205459237098694},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5388180613517761},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5114809274673462},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5073181986808777},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4850958585739136},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46055448055267334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31447476148605347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31184566020965576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18782997131347656},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.17413580417633057}],"concepts":[{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.6901429891586304},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6823666095733643},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6613399982452393},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6352429986000061},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6205459237098694},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5388180613517761},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5114809274673462},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5073181986808777},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4850958585739136},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46055448055267334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31447476148605347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31184566020965576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18782997131347656},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17413580417633057},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3382734.3405735","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405735","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405735","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2002.10889","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.10889","pdf_url":"https://arxiv.org/pdf/2002.10889","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2002.10889","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2002.10889","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:3008435726","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3382734.3405735","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405735","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405735","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3999002691","display_name":"AF: Small: Relative Fault Tolerance in Network Design","funder_award_id":"1909111","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3008435726.pdf","grobid_xml":"https://content.openalex.org/works/W3008435726.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1505970908","https://openalex.org/W1543491698","https://openalex.org/W1568961751","https://openalex.org/W1582742149","https://openalex.org/W1859011291","https://openalex.org/W1965127928","https://openalex.org/W1969080501","https://openalex.org/W1983193888","https://openalex.org/W1998544343","https://openalex.org/W2002041206","https://openalex.org/W2018963243","https://openalex.org/W2022973561","https://openalex.org/W2025919541","https://openalex.org/W2044112344","https://openalex.org/W2045446569","https://openalex.org/W2045749371","https://openalex.org/W2050809450","https://openalex.org/W2057994027","https://openalex.org/W2114493937","https://openalex.org/W2121615984","https://openalex.org/W2146522997","https://openalex.org/W2169871260","https://openalex.org/W2584101326","https://openalex.org/W2734543612","https://openalex.org/W2963583531","https://openalex.org/W2963915537","https://openalex.org/W2997658321","https://openalex.org/W3022165982","https://openalex.org/W3029326207","https://openalex.org/W4205300528","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2568005934","https://openalex.org/W2952019673","https://openalex.org/W3197569309","https://openalex.org/W2058208407","https://openalex.org/W2440719976","https://openalex.org/W1541239238","https://openalex.org/W2947028728","https://openalex.org/W330735796","https://openalex.org/W1599270014","https://openalex.org/W2561538614","https://openalex.org/W2953295060","https://openalex.org/W1577360600","https://openalex.org/W2030825457","https://openalex.org/W1513252978","https://openalex.org/W2798933500","https://openalex.org/W2739177441","https://openalex.org/W2030458698","https://openalex.org/W1985159132","https://openalex.org/W1579390654","https://openalex.org/W1568348011"],"abstract_inverted_index":{"It":[0],"was":[1,53],"recently":[2],"shown":[3],"that":[4,17,96],"a":[5,12,45,83,105],"version":[6],"of":[7,14],"the":[8,26,36,61,109,113,133],"greedy":[9,114],"algorithm":[10,27,40,47,86,115],"gives":[11],"construction":[13],"fault-tolerant":[15,51,67,94],"spanners":[16,52,68,95],"is":[18,32,41],"size-optimal,":[19],"at":[20],"least":[21],"for":[22],"vertex":[23],"faults.":[24],"However,":[25],"to":[28,48,100,116],"construct":[29,49],"this":[30,123],"spanner":[31],"not":[33],"polynomial-time,":[34],"and":[35,76,92,135],"best-known":[37],"polynomial":[38,90,119],"time":[39,91],"significantly":[42],"suboptimal.":[43],"Designing":[44],"polynomial-time":[46],"(near-)optimal":[50],"given":[54],"as":[55],"an":[56],"explicit":[57],"open":[58],"problem":[59],"in":[60,89,108,118,131],"two":[62],"most":[63],"recent":[64],"papers":[65],"on":[66],"([Bodwin,":[69],"Dinitz,":[70],"Parter,":[71],"Vassilevka":[72],"Williams":[73],"SODA":[74],"'18]":[75],"[Bodwin,":[77],"Patel":[78],"PODC":[79],"'19]).":[80],"We":[81],"give":[82,127],"surprisingly":[84],"simple":[85,128],"which":[87],"runs":[88],"constructs":[93],"are":[97],"extremely":[98],"close":[99],"optimal":[101],"(off":[102],"by":[103,111],"only":[104],"linear":[106],"factor":[107],"stretch)":[110],"modifying":[112],"run":[117],"time.":[120],"To":[121],"complement":[122],"result,":[124],"we":[125],"also":[126],"distributed":[129],"constructions":[130],"both":[132],"LOCAL":[134],"CONGEST":[136],"models.":[137]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}