{"id":"https://openalex.org/W7161153211","doi":"https://doi.org/10.48550/arxiv.2605.13800","title":"Low-Cost Arborescence Under Edge Faults","display_name":"Low-Cost Arborescence Under Edge Faults","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161153211","doi":"https://doi.org/10.48550/arxiv.2605.13800"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13800","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.13800","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070239198","display_name":"Dipan Dey","orcid":"https://orcid.org/0009-0001-0675-8790"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dey, Dipan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136185310","display_name":"Telikepalli Kavitha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kavitha, Telikepalli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7105000019073486,"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.7105000019073486,"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.22849999368190765,"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.01889999955892563,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.48660001158714294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47360000014305115},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4684999883174896},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44510000944137573},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.40700000524520874},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4032999873161316},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.3691999912261963}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6484000086784363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5544000267982483},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.48660001158714294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47360000014305115},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4684999883174896},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.40700000524520874},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.3691999912261963},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.3492000102996826},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3312000036239624},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3303000032901764},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3215000033378601},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.28850001096725464},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13800","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.13800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13800","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Our":[0,240],"input":[1,249],"is":[2,31,60,67,87,155,181,213,243,250,267],"a":[3,16,22,34,49,80,93,110,115,132,143,171,189,195,208,214,217,231,251,259,270,276,296,304,313],"directed":[4],"graph":[5],"$G":[6,97,147],"=":[7,254],"(V,E)$":[8],"on":[9,309],"$n$":[10],"vertices":[11],"and":[12,21,55,166],"$m$":[13],"edges":[14],"with":[15,258,287],"designated":[17],"root":[18],"vertex":[19],"$r$":[20],"function":[23,260],"$cost:":[24,261],"E":[25,262],"\\rightarrow":[26,263],"\\mathbb{R}_{\\geq":[27],"0}$.":[28],"The":[29,248,265],"problem":[30,159,242,266],"to":[32,76,79,108,130,141,193,268],"maintain":[33],"min-cost":[35,64,81,94,133,209,218,233,297],"arborescence":[36,65,82,95,134,145,210,219,234],"in":[37,39,83,96,114,120,135,139,146,211,220,235,237,244],"$G$":[38],"the":[40,57,62,88,121,151,156,182,245,291,310],"presence":[41],"of":[42,123,176,184,198,216,299,307,312],"edge":[43,59,71,125,185,225],"faults":[44,52],"(a":[45],"single":[46],"fault":[47,72,226],"at":[48],"time).":[50],"Edge":[51],"are":[53],"transient":[54],"once":[56],"faulty":[58,89],"repaired,":[61],"original":[63],"$\\mathcal{T}$":[66,78],"restored.":[68],"Whenever":[69],"an":[70,224],"happens,":[73,227],"we":[74,106,228],"need":[75],"update":[77],"$G-f$,":[84],"where":[85,179],"$f$":[86,126],"edge.":[90],"Since":[91],"computing":[92],"-":[98,137,148],"f$":[99,138],"takes":[100],"$O(m":[101],"+":[102],"n\\log":[103],"n)$":[104],"time,":[105],"seek":[107],"construct":[109,194],"sparse":[111,271],"subgraph":[112,158,175,196],"$H$":[113,197],"preprocessing":[116],"step":[117],"such":[118,201,280],"that":[119,281],"event":[122],"any":[124,204,283],"failing,":[127],"it":[128],"suffices":[129],"compute":[131,269],"$H":[136],"order":[140],"find":[142,230],"low-cost":[144],"f$.":[149],"In":[150],"unweighted":[152],"setting,":[153],"this":[154],"fault-tolerant":[157],"for":[160,203,282],"single-source":[161],"{\\em":[162],"reachability}.":[163],"Baswana,":[164],"Choudhary,":[165],"Roditty":[167],"(SICOMP,":[168],"2018)":[169],"showed":[170],"$k$-fault":[172,277,314],"tolerant":[173,278,315],"reachability":[174],"size":[177,199,311],"$O(2^kn)$,":[178],"$k$":[180],"number":[183],"faults.":[186],"We":[187,302],"show":[188,303],"simple":[190],"polynomial-time":[191],"algorithm":[192],"$O(n^{3/2})$":[200,238],"that,":[202],"$f":[205],"\\in":[206],"E$,":[207],"$H-f$":[212],"2-approximation":[215],"$G-f$.":[221],"Thus":[222],"whenever":[223],"can":[229],"2-approximate":[232],"$G-f$":[236],"time.":[239],"second":[241],"matroid":[246,252,292],"setting.":[247],"$M":[253],"(E,":[255],"{\\cal":[256],"I})$":[257],"\\mathbb{R}$.":[264],"$S":[272],"\\subseteq":[273,285],"E$":[274,286],"(called":[275],"preserver)":[279],"$F":[284],"$|F|":[288],"\\le":[289],"k$,":[290],"$M|(S\\setminus":[293],"F)$":[294],"contains":[295],"basis":[298],"$M|(E\\setminus":[300],"F)$.":[301],"tight":[305],"bound":[306],"$k.rank(E)$":[308],"preserver.":[316]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-15T00:00:00"}