K-Shortest Simple Paths Using Biobjective Path Search
Data Structures and Algorithms
2023-09-20 v1 Discrete Mathematics
Abstract
In this paper we introduce a new algorithm for the \emph{-Shortest Simple Paths} (\kspp{k}) 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 \citet{Roditty12} that solves at most instances of the \emph{Second Shortest Simple Path} (\kspp{2}) problem without specifying how this is done. We fill this gap using a novel approach: we turn the scalar \kspp{2} 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.
Cite
@article{arxiv.2309.10377,
title = {K-Shortest Simple Paths Using Biobjective Path Search},
author = {Pedro Maristany de las Casas and Antonio Sedeño-Noda and Ralf Borndörfer and Max Huneshagen},
journal= {arXiv preprint arXiv:2309.10377},
year = {2023}
}