An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Low-Cost Arborescence Under Edge Faults
An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.