Publisher
Springer Nature Switzerland
Reference19 articles.
1. Hassene Aissi, Cristina Bazgan, and Daniel Vanderpooten. “Approximating min-max (regret) versions of some polynomial problems”. In: Computing and Combinatorics: 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15–18, 2006. Proceedings 12. Springer. 2006, pp. 428–438.
2. Igor Averbakh and Vasilij Lebedev. “Interval data minmax regret network optimization problems”. In: Discrete Applied Mathematics 138.3 (2004), pp. 289–301.
3. Artur Alves Pessoa et al. “Robust constrained shortest path problems under budgeted uncertainty”. In: Networks 66.2 (2015), pp. 98–111.
4. Amotz Bar-Noy, Samir Khuller, and Baruch Schieber. The complexity of finding most vital arcs and nodes. Digital Repository at the University of Maryland, 1998.
5. Christina Büsing. “Recoverable robust shortest path problems”. In: Networks 59.1 (2012), pp. 181–189.