Solving the recoverable robust shortest path problem in DAGs
Data Structures and Algorithms
2023-09-07 v1
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.
Cite
@article{arxiv.2309.02816,
title = {Solving the recoverable robust shortest path problem in DAGs},
author = {Marcel Jackiewicz and Adam Kasperski and Pawel Zielinski},
journal= {arXiv preprint arXiv:2309.02816},
year = {2023}
}