{"id":"https://openalex.org/W4285011861","doi":"https://doi.org/10.1145/3490148.3538564","title":"Preparing for Disaster","display_name":"Preparing for Disaster","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285011861","doi":"https://doi.org/10.1145/3490148.3538564"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","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/A5078649776","display_name":"Calvin Newport","orcid":"https://orcid.org/0009-0006-0353-8254"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Calvin Newport","raw_affiliation_strings":["Georgetown University, Washington, D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, D.C., DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042521435","display_name":"Nitin H. Vaidya","orcid":"https://orcid.org/0000-0001-5104-8977"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nitin Vaidya","raw_affiliation_strings":["Georgetown University, Washington, D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, D.C., DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109082714","display_name":"Alex Weaver","orcid":null},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Weaver","raw_affiliation_strings":["Georgetown University, Washington, D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, D.C., DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078649776"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09107372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"74"},"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.9912999868392944,"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.9912999868392944,"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.9804999828338623,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9715999960899353,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45663315057754517}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45663315057754517}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8600000143051147,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[{"id":"https://openalex.org/G3298099467","display_name":null,"funder_award_id":"1733872","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":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1957963525","https://openalex.org/W1970700632","https://openalex.org/W1980501142","https://openalex.org/W1998643836","https://openalex.org/W2022155283","https://openalex.org/W2034396486","https://openalex.org/W2054910423","https://openalex.org/W2067661972","https://openalex.org/W2071114738","https://openalex.org/W2136185479","https://openalex.org/W2151690061","https://openalex.org/W2165441947","https://openalex.org/W2223308607","https://openalex.org/W2467514673","https://openalex.org/W2762951336"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2093578348","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2766271392","https://openalex.org/W2350741829","https://openalex.org/W3004735627"],"abstract_inverted_index":{"Distributed":[0],"algorithms":[1],"for":[2,135],"constructing":[3],"structures":[4],"such":[5],"as":[6,90,92],"a":[7,28],"maximal":[8,13],"independent":[9],"set":[10],"(MIS)":[11],"or":[12],"matching":[14],"(MM)":[15],"are":[16,80,95],"well-studied":[17],"in":[18,34,97,119,123],"standard":[19],"message-passing":[20],"network":[21],"models.":[22],"In":[23,70],"this":[24,32],"paper,":[25],"we":[26,36],"consider":[27],"natural":[29],"variant":[30],"of":[31,41,77],"problem":[33],"which":[35,101,124],"begin":[37],"with":[38],"an":[39,74],"instance":[40],"the":[42,56,60,71,88,98,102,108,113,129,139],"graph":[43,61],"structure":[44,62,89,114],"and":[45,117],"partition":[46],"our":[47],"algorithm":[48],"execution":[49],"that":[50],"follows":[51],"into":[52],"two":[53],"stages.":[54],"During":[55],"first":[57,130],"stage":[58,131],"after":[59],"is":[63,68,84],"calculated,":[64],"some":[65],"additional":[66],"precomputation":[67,126],"done.":[69],"second":[72],"stage,":[73],"arbitrary":[75],"collection":[76],"k":[78],"nodes":[79],"crashed.":[81],"The":[82],"goal":[83],"to":[85,111],"then":[86],"repair":[87,103],"efficiently":[91],"possible.":[93],"We":[94],"interested":[96],"circumstances":[99],"under":[100],"can":[104,132],"be":[105,133],"faster":[106,136],"than":[107],"time":[109],"required":[110],"build":[112],"from":[115],"scratch,":[116],"focus,":[118],"particular,":[120],"on":[121],"trade-offs":[122],"extra":[125],"rounds":[127],"during":[128,138],"traded":[134],"repairs":[137],"second.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
