2000 character limit reached
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse (2403.20000v1)
Published 29 Mar 2024 in cs.CC
Abstract: In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted interval uncertainty representation is used to model uncertain second-stage arc costs. The known complexity results for this problem are strengthened. It is shown that it is Sigma_3p-hard for the arc exclusion and the arc symmetric difference neighborhoods. Furthermore, it is also proven that the inner adversarial problem for these neighborhoods is Pi_2p-hard.
- Network Flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993.
- The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD, 1995.
- D. Bertsimas and M. Sim. The price of robustness. Operations research, 52:35–53, 2004.
- C. Büsing. Recoverable robust shortest path problems. Networks, 59:181–189, 2012.
- Incremental network optimization: theory and algorithms. Operations Research, 57:586–594, 2009.
- The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111–121, 1980.
- On the complexity of robust multi-stage problems with discrete recourse. Discrete Applied Mathematics, 343:355–370, 2024.
- The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics, 26:105–115, 1990.
- E. Nasrabadi and J. B. Orlin. Robust optimization with incremental recourse. CoRR, abs/1312.4075, 2013.
- M. Schaefer and U. Christopher. Completeness in the Polynomial-Time Hierarchy: A compendium. SIGACT News, 33:32–49, 2002.