{"id":"https://openalex.org/W2766479655","doi":"https://doi.org/10.1137/21m1442176","title":"Reachability Preservers: New Extremal Bounds and Approximation Algorithms","display_name":"Reachability Preservers: New Extremal Bounds and Approximation Algorithms","publication_year":2024,"publication_date":"2024-03-13","ids":{"openalex":"https://openalex.org/W2766479655","doi":"https://doi.org/10.1137/21m1442176","mag":"2766479655"},"language":"en","primary_location":{"id":"doi:10.1137/21m1442176","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/21m1442176","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/A5051832024","display_name":"Amir Abboud","orcid":"https://orcid.org/0000-0002-0502-4517"},"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":"Amir Abboud","raw_affiliation_strings":["Weizmann Institute, Rehovot, 7610001 Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, 7610001 Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036011801","display_name":"Greg Bodwin","orcid":"https://orcid.org/0000-0001-9896-8906"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greg Bodwin","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI 48109 USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI 48109 USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051832024"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00170887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"2","first_page":"221","last_page":"246"},"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.9997000098228455,"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.9997000098228455,"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.9980999827384949,"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.9980999827384949,"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/reachability","display_name":"Reachability","score":0.9053572416305542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44624489545822144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4421309530735016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40333640575408936},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40277355909347534}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9053572416305542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44624489545822144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4421309530735016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40333640575408936},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40277355909347534}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1442176","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/21m1442176","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":[{"id":"https://openalex.org/G6462315252","display_name":null,"funder_award_id":"BSF:2012338","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G6956728743","display_name":null,"funder_award_id":"CCF-1528078","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7613647231","display_name":null,"funder_award_id":"CCF-1514339","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7715961861","display_name":null,"funder_award_id":"CCF-1417238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7935474774","display_name":null,"funder_award_id":"AF 2153680","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"},{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W345196136","https://openalex.org/W1492237614","https://openalex.org/W1968729061","https://openalex.org/W1971316210","https://openalex.org/W1972920042","https://openalex.org/W1986144992","https://openalex.org/W2005191532","https://openalex.org/W2009976792","https://openalex.org/W2022092881","https://openalex.org/W2023600080","https://openalex.org/W2026486940","https://openalex.org/W2028697609","https://openalex.org/W2031536548","https://openalex.org/W2035767178","https://openalex.org/W2037034819","https://openalex.org/W2056403031","https://openalex.org/W2071769989","https://openalex.org/W2080551019","https://openalex.org/W2082352769","https://openalex.org/W2096304547","https://openalex.org/W2103027585","https://openalex.org/W2109721451","https://openalex.org/W2115730486","https://openalex.org/W2118382442","https://openalex.org/W2157338838","https://openalex.org/W2164542539","https://openalex.org/W2196216888","https://openalex.org/W2265961706","https://openalex.org/W2268724598","https://openalex.org/W2296109891","https://openalex.org/W2398523608","https://openalex.org/W2413699622","https://openalex.org/W2508647357","https://openalex.org/W2542527648","https://openalex.org/W2548013424","https://openalex.org/W2562627112","https://openalex.org/W2567279537","https://openalex.org/W2569942321","https://openalex.org/W2599124770","https://openalex.org/W2620939520","https://openalex.org/W2708101729","https://openalex.org/W2725976336","https://openalex.org/W2750647157","https://openalex.org/W2809995963","https://openalex.org/W2887126728","https://openalex.org/W2962992394","https://openalex.org/W2963209922","https://openalex.org/W2963228239","https://openalex.org/W2963319367","https://openalex.org/W2963664420","https://openalex.org/W2963993786","https://openalex.org/W2999281610","https://openalex.org/W2999762092","https://openalex.org/W3022037017","https://openalex.org/W3100089996","https://openalex.org/W3138287827","https://openalex.org/W3153642276","https://openalex.org/W3199376991","https://openalex.org/W3201916240"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W4221156924"],"abstract_inverted_index":{".We":[0],"define":[1],"and":[2,27,77,150,203,208],"study":[3],"reachability":[4,39,48,66,98,124],"preservers,":[5],"a":[6,20,28,38,42,57,89,97,108,130,142],"graph-theoretic":[7],"primitive":[8],"that":[9,46,113],"has":[10],"been":[11,170],"implicit":[12],"in":[13,120,129,190,211],"prior":[14,157],"work":[15],"on":[16,62,100,219],"network":[17],"design.":[18],"Given":[19],"directed":[21,191,204],"graph":[22,76,147,232],"\\(G":[23],"=":[24],"(V,":[25],"E)\\)":[26],"set":[29],"of":[30,59,65,80,133,138,163,179,197,213],"demand":[31,51,78],"pairs":[32,52,79],"\\(P":[33,83],"\\subseteq":[34,84],"V":[35],"\\times":[36,86],"V\\),":[37],"preserver":[40,99],"is":[41,56,95,141],"sparse":[43],"subgraph":[44],"\\(H\\)":[45],"preserves":[47],"between":[49,145,165],"all":[50],"Our":[53,68],"first":[54],"contribution":[55,137],"series":[58],"extremal":[60,146],"bounds":[61],"the":[63,81,118,161,177,180,185,194,214],"size":[64,123],"preservers.":[67],"main":[69],"result":[70],"states":[71],"that,":[72],"for":[73,88,184],"an":[74],"\\(n\\)-node":[75],"form":[82],"S":[85],"V\\)":[87],"small":[90],"node":[91],"subset":[92],"\\(S\\),":[93],"there":[94],"always":[96],"\\(O(n+\\sqrt{n":[101],"|P|":[102],"|S|})\\)":[103],"edges.":[104],"We":[105],"additionally":[106],"give":[107],"lower":[109,209],"bound":[110,116],"construction":[111],"demonstrating":[112],"this":[114,139,159],"upper":[115],"characterizes":[117],"settings":[119],"which":[121],"\\(O(n)\\)":[122],"preservers":[125],"are":[126],"generally":[127],"possible,":[128],"large":[131],"range":[132],"parameters.":[134],"The":[135],"second":[136],"paper":[140],"new":[143],"connection":[144],"sparsification":[148],"results":[149],"classical":[151],"Steiner":[152,230],"Network":[153],"Design":[154],"problems.":[155],"Surprisingly,":[156],"to":[158,175,227],"work,":[160],"osmosis":[162],"techniques":[164],"these":[166],"two":[167],"fields":[168],"had":[169],"superficial.":[171],"This":[172],"allows":[173],"us":[174],"improve":[176],"state":[178],"art":[181],"approximation":[182],"algorithms":[183],"most":[186],"basic":[187],"Steiner-type":[188],"problem":[189],"graphs":[192],"from":[193],"\\(O(n^{0.6+\\varepsilon":[195],"})\\)":[196],"Chlamt\u00e1\u010d":[198],"et":[199],"al.":[200],"[Approximating":[201],"spanners":[202],"steiner":[205],"forest:":[206],"Upper":[207],"bounds,":[210],"Proceedings":[212],"Twenty-Eighth":[215],"Annual":[216],"ACM-SIAM":[217],"Symposium":[218],"Discrete":[220],"Algorithms,":[221],"SIAM,":[222],"Philadelphia,":[223],"2017,":[224],"pp.":[225],"534\u2013553]":[226],"\\(O(n^{4/7+\\varepsilon":[228],"})\\).Keywordsreachabilitypreserversdirected":[229],"networkextremal":[231],"theoryapproximation":[233],"algorithmsgraph":[234],"sparsifiersgraph":[235],"algorithmsMSC":[236],"codes68Q2505C3505C3805C4005C85":[237]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}