TY - GEN
T1 - Delay-Robust Routes in Temporal Graphs
AU - Füchsle, Eugen
AU - Molter, Hendrik
AU - Niedermeier, Rolf
AU - Renken, Malte
N1 - Publisher Copyright:
© Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken.
PY - 2022/3/1
Y1 - 2022/3/1
N2 - Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of itineraries. This has already led to several well-studied algorithmic problems on temporal graphs. The difficulty of the described task is increased by the fact that connections are often unreliable – in particular, many modes of transportation suffer from occasional delays. If these delays cause subsequent connections to be missed, the consequences can be severe. Thus, it is a vital problem to design itineraries that are robust to (small) delays. We initiate the study of this problem from a parameterized complexity perspective by proving its NP-completeness as well as several hardness and tractability results for natural parameterizations.
AB - Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of itineraries. This has already led to several well-studied algorithmic problems on temporal graphs. The difficulty of the described task is increased by the fact that connections are often unreliable – in particular, many modes of transportation suffer from occasional delays. If these delays cause subsequent connections to be missed, the consequences can be severe. Thus, it is a vital problem to design itineraries that are robust to (small) delays. We initiate the study of this problem from a parameterized complexity perspective by proving its NP-completeness as well as several hardness and tractability results for natural parameterizations.
KW - Algorithms and complexity
KW - Journeys
KW - Parameterized complexity
KW - Temporal paths
KW - Time-varying networks
UR - http://www.scopus.com/inward/record.url?scp=85126186124&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.STACS.2022.30
DO - 10.4230/LIPIcs.STACS.2022.30
M3 - Conference contribution
AN - SCOPUS:85126186124
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
A2 - Berenbrink, Petra
A2 - Monmege, Benjamin
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
Y2 - 15 May 2022 through 18 May 2022
ER -