TR-2016-19

Reachability-based matroid-restricted packing of arborescences

Abstract

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