TY - GEN
T1 - Temporal Connectivity
T2 - 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
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; licensed under Creative Commons License CC-BY 4.0
PY - 2022/4/1
Y1 - 2022/4/1
N2 - Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficulty is that trains, unfortunately, sometimes get delayed. This is especially bad if it causes one to miss subsequent trains. The best way to prepare against this is to have a connection that is robust to some number of (small) delays. An important factor in determining the robustness of a connection is how far in advance delays are announced. We give polynomial-time algorithms for the two extreme cases: delays known before departure and delays occurring without prior warning (the latter leading to a two-player game scenario). Interestingly, in the latter case, we show that the problem becomes PSPACE-complete if the itinerary is demanded to be a path.
AB - Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficulty is that trains, unfortunately, sometimes get delayed. This is especially bad if it causes one to miss subsequent trains. The best way to prepare against this is to have a connection that is robust to some number of (small) delays. An important factor in determining the robustness of a connection is how far in advance delays are announced. We give polynomial-time algorithms for the two extreme cases: delays known before departure and delays occurring without prior warning (the latter leading to a two-player game scenario). Interestingly, in the latter case, we show that the problem becomes PSPACE-complete if the itinerary is demanded to be a path.
KW - PSPACE-completeness
KW - Paths and walks in temporal graphs
KW - dynamic programming
KW - flow computations
KW - static expansions of temporal graphs
KW - two-player games
UR - http://www.scopus.com/inward/record.url?scp=85130804816&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.SAND.2022.17
DO - 10.4230/LIPIcs.SAND.2022.17
M3 - Conference contribution
AN - SCOPUS:85130804816
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
A2 - Aspnes, James
A2 - Michail, Othon
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 28 March 2022 through 30 March 2022
ER -
