Packing of arborescences with matroid constraints via matroid intersection

Edmonds’ arborescence packing theorem characterizes directed graphs that have arc-disjoint spanning arborescences in terms of connectivity. Later he also observed a characterization in terms of matroid intersection. Since these fundamental results, intensive research has been done for understanding and extending these results. In this paper we shall extend the second characterization to the setting of reachability-based packing of arborescences. The reachability-based packing problem was introduced by Cs. Király as a common generalization of two different extensions of the spanning arborescence packing problem, one is due to Kamiyama, Katoh, and Takizawa, and the other is due to Durand de Gevigney, Nguyen, and Szigeti. Our new characterization of the arc sets of reachability-based packing in terms of matroid intersection gives an efficient algorithm for the minimum weight reachability-based packing problem, and it also enables us to unify further arborescence packing theorems and Edmonds’ matroid intersection theorem. For the proof, we also show how a new class of matroids can be defined by extending an earlier construction of matroids from intersecting submodular functions to bi-set functions based on an idea of Frank.

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

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

[3]  Hazel Perfect,et al.  A generalization of Rado's theorem on independent transversals , 1969, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  M. Iri,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .

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

[6]  Zoltán Szigeti,et al.  On packing spanning arborescences with matroid constraint , 2017, Electron. Notes Discret. Math..

[7]  J. Edmonds.  Some Well-Solved Problems in Combinatorial Optimization , 1975 .

[8]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[9]  藤重 悟.  Submodular functions and optimization , 1991 .

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

[11]  Attila Bernáth,et al.  Blocking Optimal k-Arborescences , 2015, SODA.

[12]  H. Imai.  NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS , 1983 .

[13]  Yin Tat Lee,et al.  A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[14]  Naonori Kakimura,et al.  Exact and approximation algorithms for weighted matroid intersection , 2016, Mathematical Programming.

[15]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

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

[17]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[18]  Zoltán Szigeti,et al.  Old and new results on packing arborescences in directed hypergraphs , 2018, Discret. Appl. Math..

[19]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[20]  R. Rado.  A THEOREM ON INDEPENDENCE RELATIONS , 1942 .

[21]  J. Edmonds.  Matroid Intersection , 2022 .

[22]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[23]  András Frank,et al.  Rooted k-connections in digraphs , 2009, Discret. Appl. Math..

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

[25]  Zoltán Szigeti,et al.  Reachability-based matroid-restricted packing of arborescences , 2017 .

[26]  Atsushi Takizawa,et al.  Arc-disjoint in-trees in directed graphs , 2008, SODA '08.

[27]  Z. Szigeti,et al.  MATHEMATICAL ENGINEERING TECHNICAL REPORTS An Algorithm for the Problem of Minimum Weight Packing of Arborescences with Matroid Constraints , 2017 .

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