arXiv Open Access 2022

On packing time-respecting arborescences

Romain Chapoullié Zoltán Szigeti

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM math.CO

Penulis (2)

Romain Chapoullié

Zoltán Szigeti

Format Sitasi

APA MLA BibTeX

Chapoullié, R., Szigeti, Z. (2022). On packing time-respecting arborescences. https://arxiv.org/abs/2203.01096

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓