On packing time-respecting arborescences
Romain Chapoulli\'e, Zolt\'an Szigeti
TL;DR
This paper extends the study of packing time-respecting arborescences from acyclic to non-acyclic temporal networks, providing new theoretical insights and complexity results.
Contribution
It introduces the first results on packing time-respecting arborescences in non-acyclic networks and establishes NP-completeness for related decision problems.
Findings
First results for non-acyclic networks
NP-completeness of certain packing problems
Extension of previous acyclic network results
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Interconnection Networks and Systems