TY - JOUR A1 - Maristany de las Casas, Pedro A1 - Sedeño-Noda, Antonio A1 - Borndörfer, Ralf A1 - Huneshagen, Max T1 - K-Shortest Simple Paths Using Biobjective Path Search JF - Arxiv Preprint N2 - In this paper we introduce a new algorithm for the k-Shortest Simple Paths (K-SSP) problem with an asymptotic running time matching the state of the art from the literature. It is based on a black-box algorithm due to Roditty and Zwick (2012) that solves at most 2k instances of the Second Shortest Simple Path (2-SSP) problem without specifying how this is done. We fill this gap using a novel approach: we turn the scalar 2-SSP into instances of the Biobjective Shortest Path problem. Our experiments on grid graphs and on road networks show that the new algorithm is very efficient in practice. Y1 - 2023 U6 - https://doi.org/10.48550/arXiv.2309.10377 ER -