This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable in general digraphs. Polynomial time algorithms for the problem under consideration in DAGs are proposed.

翻译：本文研究区间不确定性表示下的可恢复鲁棒最短路径问题。该问题已知为强NP难问题，且在一般有向图中不可近似。本文提出了有向无环图中该问题的多项式时间算法。