2000 character limit reached
Solving the recoverable robust shortest path problem in DAGs (2309.02816v1)
Published 6 Sep 2023 in cs.DS
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.