arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.05390cs.DS
收藏

时态图中的时延鲁棒路由

Delay-Robust Routes in Temporal Graphs

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

摘要:

大多数交通网络本质上是临时的:连接(例如航班,训练运行)仅在特定的预定时间可用。在运送乘客或商品时,必须考虑这一事实,以规划行程。这已经导致了时间图上几个经过充分研究的算法问题。由于连接往往不可靠,特别是许多运输方式偶尔会出现延误,因此增加了上述任务的难度。如果这些延迟导致后续连接被错过,后果可能会很严重。因此,它是一个至关重要的问题,设计行程,是强大的(小)延误。我们从参数化复杂性的角度出发,通过证明其NP-完全性以及自然参数化的一些硬度和易处理性结果来研究这个问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑