License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2022.30
URN: urn:nbn:de:0030-drops-158403
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15840/
Go to the corresponding LIPIcs Volume Portal

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

Delay-Robust Routes in Temporal Graphs

pdf-format:
LIPIcs-STACS-2022-30.pdf (0.8 MB)

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.

BibTeX - Entry

@InProceedings{fuchsle_et_al:LIPIcs.STACS.2022.30,
  author =	{F\"{u}chsle, Eugen and Molter, Hendrik and Niedermeier, Rolf and Renken, Malte},
  title =	{{Delay-Robust Routes in Temporal Graphs}},
  booktitle =	{39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
  pages =	{30:1--30:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-222-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{219},
  editor =	{Berenbrink, Petra and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15840},
  URN =		{urn:nbn:de:0030-drops-158403},
  doi =		{10.4230/LIPIcs.STACS.2022.30},
  annote =	{Keywords: algorithms and complexity, parameterized complexity, time-varying networks, temporal paths, journeys}
}

Keywords: algorithms and complexity, parameterized complexity, time-varying networks, temporal paths, journeys
Collection: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Issue Date: 2022
Date of publication: 09.03.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI