On packing time-respecting arborescences
Discrete Mathematics
2022-03-03 v1 Combinatorics
Abstract
We present a slight generalization of the result of Kamiyama and Kawase \cite{kamkaw} 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.
Cite
@article{arxiv.2203.01096,
title = {On packing time-respecting arborescences},
author = {Romain Chapoullié and Zoltán Szigeti},
journal= {arXiv preprint arXiv:2203.01096},
year = {2022}
}