Minimum-Cost -Arborescence Packing in TimeResearch Paper
A packing of arc-disjoint spanning arborescences rooted at a common vertex keeps every vertex reachable from after the deletion of any arcs. Finding such a packing of minimum total cost is a building block of approximation algorithms for network design, including minimum-cost -edge-connected spanning subgraphs and flexible graph connectivity, and…