Delay-Robust Routes in Temporal Graphs

Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
EditorsPetra Berenbrink, Benjamin Monmege
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772228
DOIs
StatePublished - 1 Mar 2022
Event39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022 - Virtual, Marseille, France
Duration: 15 May 202218 May 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume219
ISSN (Print)1868-8969

Conference

Conference39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
Country/TerritoryFrance
CityVirtual, Marseille
Period15/05/2218/05/22

Keywords

  • Algorithms and complexity
  • Journeys
  • Parameterized complexity
  • Temporal paths
  • Time-varying networks

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Delay-Robust Routes in Temporal Graphs'. Together they form a unique fingerprint.

Cite this