Document Open Access Logo

Delay-Robust Routes in Temporal Graphs

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

PDF
Thumbnail PDF

File

LIPIcs.STACS.2022.30.pdf
  • Filesize: 0.75 MB
  • 15 pages

Document Identifiers

Author Details

Eugen Füchsle
  • Faculty IV, Algorithmics and Computational Complexity, TU Berlin, Germany
Hendrik Molter
  • Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Rolf Niedermeier
  • Faculty IV, Algorithmics and Computational Complexity, TU Berlin, Germany
Malte Renken
  • Faculty IV, Algorithmics and Computational Complexity, TU Berlin, Germany

Funding

  • Molter, Hendrik: Supported by the ISF, grant No. 1070/20.
  • Renken, Malte: Supported by the DFG, project MATE (NI 369/17).

Cite As Get BibTex

Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken. Delay-Robust Routes in Temporal Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.STACS.2022.30

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Fixed parameter tractability
  • Mathematics of computing → Discrete mathematics
Keywords
  • algorithms and complexity
  • parameterized complexity
  • time-varying networks
  • temporal paths
  • journeys

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, and Rolf Niedermeier. Efficient computation of optimal temporal walks under waiting-time constraints. Applied Network Science, 5(1):73, 2020. URL: https://doi.org/10.1007/s41109-020-00311-0.
  2. Kenneth A Berman. Vulnerability of scheduled networks and a generalization of Menger’s theorem. Networks, 28(3):125-134, 1996. URL: https://doi.org/10.1002/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P.
  3. Binh-Minh Bui-Xuan, Afonso Ferreira, and Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(02):267-285, 2003. URL: https://doi.org/10.1142/S0129054103001728.
  4. Sebastian Buß, Hendrik Molter, Rolf Niedermeier, and Maciej Rymar. Algorithmic aspects of temporal betweenness. In Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2020, pages 2084-2092. ACM, 2020. URL: https://doi.org/10.1145/3394486.3403259.
  5. Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems, 27(5):387-408, 2012. URL: https://doi.org/10.1080/17445760.2012.668546.
  6. Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. Algorithmica, 83(9):2754-2802, 2021. URL: https://doi.org/10.1007/s00453-021-00831-w.
  7. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  8. Argyrios Deligkas and Igor Potapov. Optimizing reachability sets in temporal graphs by delaying. In Proceedings of the 34th Conference on Artificial Intelligence (AAAI), pages 9810-9817, 2020. URL: https://doi.org/10.1609/aaai.v34i06.6533.
  9. Edsger W Dijkstra et al. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, 1959. URL: https://doi.org/10.1007/BF01386390.
  10. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Springer, 2013. URL: https://doi.org/10.1007/978-1-4471-5559-1.
  11. Jessica Enright and Kitty Meeks. Deleting edges to restrict the size of an epidemic: a new application for treewidth. Algorithmica, 80(6):1857-1889, 2018. URL: https://doi.org/10.1007/s00453-017-0311-7.
  12. Jessica Enright, Kitty Meeks, George B. Mertzios, and Viktor Zamaraev. Deleting edges to restrict the size of an epidemic in temporal networks. Journal of Computer and System Sciences, 119:60-77, 2021. URL: https://doi.org/10.1016/j.jcss.2021.01.007.
  13. Jessica Enright, Kitty Meeks, and Fiona Skerman. Assigning times to minimise reachability in temporal graphs. Journal of Computer and System Sciences, 115:169-186, 2021. URL: https://doi.org/10.1016/j.jcss.2020.08.001.
  14. Thomas Erlebach, Michael Hoffmann, and Frank Kammer. On temporal graph exploration. Journal of Computer and System Sciences, 119:1-18, 2021. URL: https://doi.org/10.1016/j.jcss.2021.01.005.
  15. Michael R Fellows, Danny Hermelin, Frances Rosamond, and Stéphane Vialette. On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410(1):53-61, 2009. URL: https://doi.org/10.1016/j.tcs.2008.09.065.
  16. Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, and Philipp Zschoche. Temporal graph classes: A view through temporal separators. Theoretical Computer Science, 806:197-218, 2020. URL: https://doi.org/10.1016/j.tcs.2019.03.031.
  17. Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken. Delay-robust routes in temporal graphs, 2022. URL: http://arxiv.org/abs/2201.05390.
  18. Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken. Temporal connectivity: Coping with foreseen and unforeseen delays, 2022. URL: http://arxiv.org/abs/2201.05011.
  19. Petter Holme. Modern temporal network theory: a colloquium. The European Physical Journal B, 88(9):234, 2015. URL: https://doi.org/10.1140/epjb/e2015-60657-4.
  20. Petter Holme and Jari Saramäki, editors. Temporal Network Theory. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-23495-9.
  21. Richard M Karp. Reducibility among combinatorial problems, pages 85-103. Springer, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  22. David Kempe, Jon Kleinberg, and Amit Kumar. Connectivity and inference problems for temporal networks. Journal of Computer and System Sciences, 64(4):820-842, 2002. URL: https://doi.org/10.1006/jcss.2002.1829.
  23. Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche. Interference-free walks in time: Temporally disjoint paths. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, pages 4090-4096. ijcai.org, 2021. URL: https://doi.org/10.24963/ijcai.2021/563.
  24. Matthieu Latapy, Tiphaine Viard, and Clémence Magnien. Stream graphs and link streams for the modeling of interactions over time. Social Network Analysis and Mining, 8(1):61, 2018. URL: https://doi.org/10.1007/s13278-018-0537-7.
  25. Othon Michail. An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics, 12(4):239-280, 2016. URL: https://doi.org/10.1080/15427951.2016.1177801.
  26. Hendrik Molter, Malte Renken, and Philipp Zschoche. Temporal reachability minimization: Delaying vs. deleting. In Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 76:1-76:15, 2021. URL: https://doi.org/10.4230/LIPIcs.MFCS.2021.76.
  27. Manuel Sorge and Mathias Weller. The graph parameter hierarchy. unpublished manuscript, 2019. URL: https://manyu.pro/assets/parameter-hierarchy.pdf.
  28. Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, and Hejun Wu. Efficient algorithms for temporal path computation. IEEE Transactions on Knowledge and Data Engineering, 28(11):2927-2942, 2016. URL: https://doi.org/10.1109/TKDE.2016.2594065.
  29. Philipp Zschoche, Till Fluschnik, Hendrik Molter, and Rolf Niedermeier. The complexity of finding small separators in temporal graphs. Journal of Computer and System Sciences, 107:72-92, 2020. URL: https://doi.org/10.1016/j.jcss.2019.07.006.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact