时间连接：应对可预见和不可预见的延迟
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
摘要：
考虑计划一次训练网络旅行。与道路网络相比，边缘是暂时的，即，它们只在特定时间可用。另一个重要的困难是，不幸的是，火车有时会晚点。这是特别糟糕的，如果它导致一个错过随后的火车。对此做好准备的最好方法是建立一个对一定数量的（小）延迟具有鲁棒性的连接。确定连接鲁棒性的一个重要因素是提前多长时间宣布延迟。我们给多项式时间算法的两种极端情况下：出发前已知的延迟和延迟发生没有事先警告（后者导致两个玩家的游戏场景）。有趣的是，在后一种情况下，我们表明，问题成为PSPACE完全，如果行程要求是一条路径。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
