Exact minimum-cost arborescences under a single arc failure
Version 1 / Nov 19, 2026 / CC BY 4.0
Abstract
Every rooted weighted digraph on n vertices has a subgraph with arcs that contains a minimum-cost spanning arborescence after any feasible single arc deletion, answering a question of Dey and Kavitha. An oracle of the same size reports an optimal arborescence or a shortest list of arc replacements in time linear in the output. The construction uses shortest cycles in a weighted matroid exchange graph and admits deterministic subcubic preprocessing on simple digraphs. A reduction from directed distance preservation gives an -bit lower bound for reporting on simple digraphs with input arc identifiers, even with constant per-query error.
Provenance statement
References
- N. Alon and B. Schieber. Optimal preprocessing for answering on-line product queries (https://arxiv.org/abs/2406.06321). Technical Report 71/87, Tel Aviv University (1987).link
- N. Alon, R. Yuster and U. Zwick. Color-coding (https://doi.org/10.1145/210332.210337). Journal of the ACM 42(4) (1995), 844--856.DOI
- G. Bodwin. A note on distance-preserving graph sparsification (https://doi.org/10.1016/j.ipl.2021.106205). Information Processing Letters 174 (2022), article 106205.DOI
- G. Bodwin, F. Grandoni, M. Parter and V. Vassilevska Williams. Preserving distances in very faulty graphs (https://doi.org/10.4230/LIPIcs.ICALP.2017.73). ICALP , LIPIcs 80 (2017), 73:1--73:14.DOI
- D. Coppersmith and M. Elkin. Sparse sourcewise and pairwise distance preservers (https://doi.org/10.1137/050630696). SIAM Journal on Discrete Mathematics 20(2) (2006), 463--501.DOI
- M. Dalirrooyfard and V. Vassilevska Williams. Conditionally optimal approximation algorithms for the girth of a directed graph (https://doi.org/10.4230/LIPIcs.ICALP.2020.35). ICALP , LIPIcs 168 (2020), 35:1--35:20.DOI
- D. Dey and T. Kavitha. Low-cost arborescence under edge faults (https://arxiv.org/abs/2605.13800v1). arXiv:2605.13800v1 (2026).arXiv
- J. Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and Their Applications (1970), 69--87.
- I. B. Essayag and A. L. Zabokritskiy. Faster deterministic all-pairs shortest paths with real edge weights (https://arxiv.org/abs/2611.17215). arXiv:2611.17215 (2026).arXiv
- M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms (https://doi.org/10.1145/28869.28874). Journal of the ACM 34(3) (1987), 596--615.DOI
Show all 16 referencesShow fewer references
- H. N. Gabow, Z. Galil, T. Spencer and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (https://doi.org/10.1007/BF02579168). Combinatorica 6(2) (1986), 109--122.DOI
- Yilin Liu and GPT-6 Astra Pro. Exact single-failure preservers (https://github.com/icekylinx/algorithm-frontier/tree/77140c264e7cc9e7d2853a7cc86c76f4a7d28/problems/exact-failure-preservers). Algorithm Frontier , source snapshot 77140c2 (2026).link
- J. B. Orlin and L. A. Végh. Directed shortest paths via approximate cost balancing (https://doi.org/10.1145/3565019). Journal of the ACM 70(1) (2022), article 3.DOI
- S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs (https://doi.org/10.1016/S0304-3975(03)00402-X). Theoretical Computer Science 312(1) (2004), 47--74.DOI
- M. Ružić. Uniform deterministic dictionaries (https://doi.org/10.1145/1328911.1328912). ACM Transactions on Algorithms 4(1) (2008), article 1.DOI
- D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees (https://doi.org/10.1016/0022-0000(83)90006-5). Journal of Computer and System Sciences 26(3) (1983), 362--391.DOI