|
|||||
|
|
On packing spanning arborescences with matroid constraint |
|
| Authors: | Quentin Fortier Csaba Király Zoltán Szigeti Shin-ichi Tanigawa |
| Institution: | 1. G-SCOP, Univ. Grenoble Alpes, Grenoble, France;2. MTA-ELTE Egerváry Research Group on Combinatorial Optimization, Department of Operations Research, ELTE Eötvös Loránd University, Budapest, Hungary;3. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan
Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands |
| Abstract: | |
| Keywords: | connectivity Edmonds’ branching theorem matroid packing arborescences |