Old and new results on packing arborescences in directed hypergraphs

We propose a further development in the theory of packing arborescences. First we review some of the existing results on packing arborescences and then we provide common generalizations of them to directed hypergraphs. We introduce and solve the problem of reachability-based packing of matroid-rooted hyperarborescences and we also solve the minimum cost version of this problem. Furthermore, we introduce and solve the problem of matroid-based packing of matroid-rooted mixed hyperarborescences.