Reachability in arborescence packings

Fortier et al. proposed several research problems on packing arborescences and settled some of them. Others were later solved by Matsuoka and Tanigawa and by Gao and Yang. The last open problem is settled in this article. We show how to turn an inductive idea used in the latter two articles into a simple proof technique that allows to relate previous results on arborescence packings. We prove that a strong version of Edmonds??? theorem on packing spanning arborescences implies Kamiyama, Katoh and Takizawa???s result on packing reachability arborescences and that Durand de Gevigney, Nguyen and Szigeti???s theorem on matroid-based packing of arborescences implies Kir??ly???s result on matroid-reachability-based packing of arborescences. Further, we deduce a new result on matroid-reachability-based packing of mixed hyperarborescences from a theorem on matroid-based packing of mixed hyperarborescences due to Fortier et al.. Finally, we deal with the algorithmic aspects of the problems considered. We first obtain algorithms to find the desired packings of arborescences in all settings and then apply Edmonds??? weighted matroid intersection algorithm to also find solutions minimizing a given weight function.