Old and new results on packing arborescences in directed hypergraphs

Abstract 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.

[1]  Zoltán Szigeti,et al.  Matroid-Based Packing of Arborescences , 2013, SIAM J. Discret. Math..

[2]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[3]  Csaba Király,et al.  On Maximal Independent Arborescence Packing , 2016, SIAM J. Discret. Math..

[4]  Zoltán Szigeti,et al.  Old and new results on packing arborescences. , 2015 .

[5]  Attila Jo'o.  Independent and maximal branching packing in infinite matroid-rooted digraphs , 2017 .

[6]  Shin-ichi Tanigawa,et al.  Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries , 2011, SIAM J. Discret. Math..

[7]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on the Orientation of Graphs and Hypergraphs on the Orientation of Graphs and Hypergraphs , 2022 .

[8]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.

[9]  Attila Joó.  Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths , 2016, J. Graph Theory.

[10]  András Frank,et al.  Variations for Lovász’ Submodular Ideas , 2008 .

[11]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on Decomposing a Hypergraph into K Connected Sub-hypergraphs on Decomposing a Hypergraph into K Connected Sub-hypergraphs , 2022 .

[12]  András Frank,et al.  Packing Arborescences , 2009 .

[13]  Yusuke Kobayashi,et al.  Algorithmic aspects of covering supermodular functions under matroid constraints , 2015 .

[14]  Yusuke Kobayashi,et al.  Covering Intersecting Bi-set Families under Matroid Constraints , 2016, SIAM J. Discret. Math..