Distributed Algorithms for the Survivable Network Design Problem: Classical and Quantum Approaches

This paper presents distributed classical and quantum algorithms for the Survivable Network Design Problem (SNDP), a generalization of many complex graph problems such as the Traveling Salesperson Problem, the Steiner Tree Problem, and the k-Connected Network Problem. The algorithms provide concrete approximation bounds for specific parameterizations of the SNDP and exhibit asymptotic quantum speedups by leveraging quantum shortest path computations.