{"id":"https://openalex.org/W3048639797","doi":"https://doi.org/10.1145/3673760","title":"Deterministic Replacement Path Covering","display_name":"Deterministic Replacement Path Covering","publication_year":2024,"publication_date":"2024-06-18","ids":{"openalex":"https://openalex.org/W3048639797","doi":"https://doi.org/10.1145/3673760","mag":"3048639797"},"language":"en","primary_location":{"id":"doi:10.1145/3673760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673760","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3673760","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3673760","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066903534","display_name":"C. S. Karthik","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Israel"],"raw_orcid":"https://orcid.org/0000-0001-9105-364X","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"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":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel","Weizmann Institute of Science, Israel"],"raw_orcid":"https://orcid.org/0000-0002-2357-2445","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Weizmann Institute of Science, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066903534"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00275344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":"20","issue":"4","first_page":"1","last_page":"35"},"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.9993000030517578,"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.9993000030517578,"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.9979000091552734,"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.9972000122070312,"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/path","display_name":"Path (computing)","score":0.5453554391860962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4833042621612549},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3288452923297882}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5453554391860962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4833042621612549},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3288452923297882}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3673760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673760","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3673760","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3673760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673760","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3673760","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3048639797.pdf"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1963633992","https://openalex.org/W1980074516","https://openalex.org/W1982876676","https://openalex.org/W1989682699","https://openalex.org/W1995096771","https://openalex.org/W1996118782","https://openalex.org/W2003177806","https://openalex.org/W2022973561","https://openalex.org/W2026486940","https://openalex.org/W2035697831","https://openalex.org/W2050687505","https://openalex.org/W2053816258","https://openalex.org/W2074728115","https://openalex.org/W2079301493","https://openalex.org/W2079896000","https://openalex.org/W2126479983","https://openalex.org/W2129939288","https://openalex.org/W2136442765","https://openalex.org/W2146522997","https://openalex.org/W2148116905","https://openalex.org/W2148575324","https://openalex.org/W2159193690","https://openalex.org/W2165621523","https://openalex.org/W2296148711","https://openalex.org/W2530362908","https://openalex.org/W2903356572","https://openalex.org/W2945847545","https://openalex.org/W2950751105","https://openalex.org/W2963051187","https://openalex.org/W2963583531","https://openalex.org/W2972150782","https://openalex.org/W2982297668","https://openalex.org/W2991878997","https://openalex.org/W3034924176","https://openalex.org/W3037510039","https://openalex.org/W3038069570","https://openalex.org/W3043660989","https://openalex.org/W3046727971","https://openalex.org/W3117774579","https://openalex.org/W4247564011","https://openalex.org/W4281651135","https://openalex.org/W4287815059","https://openalex.org/W6728534548"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2382290278","https://openalex.org/W4395014643"],"abstract_inverted_index":{"In":[0,148],"this":[1,171,191],"article,":[2],"we":[3,266,387],"provide":[4],"a":[5,22,26,34,42,62,70,108,231,259,389],"unified":[6],"and":[7,33,96,118,204,238,289,297,357,363,401,405,416],"simplified":[8],"approach":[9],"to":[10,139,155,170,275,324],"derandomize":[11],"central":[12],"results":[13],"in":[14,53,145],"the":[15,114,124,133,141,149,193,209,227,244,256,325,344,347,351,372,377,392,417,421],"area":[16],"of":[17,36,72,74,87,101,116,123,126,132,143,164,200,217,234,247,258,262,327,338,346,350,366,380,391,395,420],"fault-tolerant":[18,205,330,397],"graph":[19,23,305],"algorithms.":[20],"Given":[21],"\\(G\\)":[24,75,306],",":[25,32,41,61,76,80,168,296,299],"vertex":[27,396],"pair":[28],"\\((s,t)\\in":[29],"V(G)\\times":[30],"V(G)\\)":[31],"set":[35,85],"edge":[37],"faults":[38,91],"\\(F\\subseteq":[39],"E(G)\\)":[40],"replacement":[43,63,98],"path":[44,52,64,99],"\\(P(s,t,F)\\)":[45,100],"is":[46,69,136,153,174,313,319,343],"an":[47,157,302],"\\(s\\)":[48],"-":[49,159,219,309],"\\(t\\)":[50],"shortest":[51],"\\(G\\setminus":[54],"F\\)":[55],".":[56,128,147,315],"For":[57,293],"integer":[58],"parameters":[59],"\\(L,f\\)":[60,295],"covering":[65,130,162,223,311],"(":[66],"\\(\\mathsf{RPC}\\)":[67,134,160,220,310],")":[68,95],"collection":[71],"subgraphs":[73,144],"denoted":[77],"by":[78,185,321,355,399],"\\(\\mathcal{G}_{L,f}=\\{G_{1},\\ldots,G_{r}\\}\\)":[79],"such":[81,285],"that":[82,111,265],"for":[83,196,230],"every":[84,97,294],"\\(F\\)":[86,127],"at":[88,102],"most":[89,103],"\\(f\\)":[90],"(i.e.,":[92],"\\(|F|\\leq":[93],"f\\)":[94],"\\(L\\)":[104],"edges,":[105],"there":[106,173,300],"exists":[107,301],"subgraph":[109],"\\(G_{i}\\in\\mathcal{G}_{L,f}\\)":[110],"contains":[112],"all":[113],"edges":[115,125],"\\(P\\)":[117],"does":[119],"not":[120],"contain":[121],"any":[122],"The":[129,361,413],"value":[131,163,239,312],"\\(\\mathcal{G}_{L,f}\\)":[135,146],"then":[137,272],"defined":[138],"be":[140],"number":[142],"randomized":[150,228,373,393],"setting,":[151],"it":[152],"easy":[154],"build":[156],"\\((L,f)\\)":[158,218,308],"with":[161,179],"\\(O(\\max\\{L,f\\}^{\\min\\{L,f\\}}\\cdot\\min\\{L,f\\}\\cdot":[165],"\\log":[166],"n)\\)":[167],"but":[169],"date,":[172],"no":[175],"efficient":[176,214],"deterministic":[177,215,341,368],"algorithm":[178,369],"matching":[180],"bounds.":[181,374],"As":[182],"noted":[183],"recently":[184],"Alon":[186,381],"et":[187,382,407],"al.":[188,383,408],"(ICALP":[189,384],"2019),":[190],"poses":[192],"key":[194],"barrier":[195],"derandomizing":[197],"known":[198],"constructions":[199,216,342],"distance":[201,352],"sensitivity":[202,353],"oracles":[203],"spanners.":[206],"We":[207,271],"show":[208,273,388],"following:":[210],"\u2014":[211,292],"There":[212],"exist":[213],"s":[221],"whose":[222,307],"values":[224],"almost":[225],"match":[226,371],"ones,":[229],"wide":[232],"range":[233],"parameters.":[235],"Our":[236,251],"time":[237,365,414],"bounds":[240,419],"improve":[241],"considerably":[242],"over":[243],"previous":[245],"construction":[246,349,394],"Parter":[248],"(DISC":[249],"2019).":[250,385],"algorithms":[252],"are":[253],"based":[254],"on":[255],"introduction":[257],"novel":[260],"notion":[261],"hash":[263,269,278],"families":[264,279],"call":[267],"HM":[268],"families.":[270],"how":[274],"construct":[276],"these":[277],"from":[280],"(algebraic)":[281],"error":[282],"correcting":[283],"codes":[284,288],"as":[286],"Reed\u2013Solomon":[287],"Algebraic-Geometric":[290],"codes.":[291],"\\(n\\)":[298,303],"-vertex":[304],"\\(\\Omega(L^{f})\\)":[314],"This":[316,375],"lower":[317],"bound":[318],"obtained":[320],"exploiting":[322],"connections":[323],"problem":[326,379],"designing":[328],"sparse":[329],"breadth":[331],"first":[332],"search":[333],"(BFS)":[334],"structures.":[335],"An":[336],"application":[337],"our":[339,367],"above":[340],"derandomization":[345,390],"algebraic":[348],"oracle":[354],"Weimann":[356],"Yuster":[358],"(FOCS":[359],"2010).":[360],"preprocessing":[362],"query":[364],"nearly":[370],"resolves":[376],"open":[378],"Additionally,":[386],"spanners":[398,423],"Dinitz":[400],"Krauthgamer":[402],"(PODC":[403],"2011)":[404],"Braunschvig":[406],"(Theor.":[409],"Comput.":[410],"Sci.,":[411],"2015).":[412],"complexity":[415],"size":[418],"output":[422],"near":[424]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}