Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
Data Structures and Algorithms
2025-06-06 v2 Optimization and Control
Abstract
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem has been open to date. In this paper, we prove that the problem is strongly NP-hard even for the case of layered acyclic digraphs. We also show that for the discrete budgeted uncertainty, the problem is not approximable unless P=NP.
Cite
@article{arxiv.2410.09425,
title = {Computational complexity of the recoverable robust shortest path problem in acyclic digraphs},
author = {Adam Kasperski and Pawel Zielinski},
journal= {arXiv preprint arXiv:2410.09425},
year = {2025}
}