Solving the recoverable robust shortest path problem in DAGs

TL;DR

This paper introduces polynomial time algorithms for solving the recoverable robust shortest path problem in directed acyclic graphs (DAGs) under interval uncertainty, addressing a strongly NP-hard problem in general digraphs.

Contribution

The paper presents the first polynomial time algorithms for the recoverable robust shortest path problem specifically in DAGs, where the problem is otherwise NP-hard.

Findings

Polynomial algorithms for DAGs are effective.

The problem remains NP-hard in general digraphs.

The approach improves robustness in shortest path computations.

Abstract

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.