# Recoverable robust shortest path problem under interval budgeted uncertainty representations

arXiv: https://arxiv.org/abs/2401.05715 · HTML: https://mlsanity.com/paper/2401.05715/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Jan 2024.

## Built on by (most cited first, 1 of 1)

- [Robust Optimization Approach and Learning Based Hide-and-Seek Game for Resilient Network Design](https://mlsanity.com/paper/2602.11854/) (2026)

## Abstract (arXiv)

In this paper, the recoverable robust shortest path problem under interval uncertainty representations is discussed. This problem is known to be strongly NP-hard and also hard to approximate in general digraphs. In this paper, the class of acyclic digraphs is considered. It is shown that for the traditional interval uncertainty, the problem can be solved in polynomial time for all natural, known from the literature, neighborhoods. Efficient algorithms for various classes of acyclic digraphs are constructed. Some negative results for general digraphs are strengthened. Finally, some exact and approximate methods of solving the problem under budgeted interval uncertainty are proposed.