On packing time-respecting arborescences

03/02/2022

∙

by   Romain Chapoullié, et al.

∙

0

∙

share

We present a slight generalization of the result of Kamiyama and Kawase <cit.> on packing time-respecting arborescences in acyclic pre-flow temporal networks. Our main contribution is to provide the first results on packing time-respecting arborescences in non-acyclic temporal networks. As negative results, we prove the NP-completeness of the decision problem of the existence of 2 arc-disjoint spanning time-respecting arborescences and of a related problem proposed in this paper.