Reachability-based matroid-restricted packing of arborescences

Csaba Király, Zoltán Szigeti


The fundamental result of Edmonds [5] started the area of packing arborescences and the great number of recent results shows increasing interest of this subject. Two types of matroid constraints were added to the problem in [2, 3, 9], here we show that both contraints can be added simultaneously. This way we provide a solution to a common generalization of the reachability-based packing of arborescences problem of the first author [14] and the matroid intersection problem of Edmonds [4].

Bibtex entry:

AUTHOR = {Kir{\'a}ly, Csaba and Szigeti, Zolt{\'a}n},
TITLE = {Reachability-based matroid-restricted packing of arborescences},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2016},
NUMBER = {TR-2016-19}

Last modification: 13.3.2018. Please email your comments to Tamás Király!