In this paper we introduce a new algorithm for the \emph{$k$-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 $2k$ 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.

翻译：本文提出了一种针对\emph{$k$-最短简单路径}（\kspp{k}）问题的新算法，其渐近运行时间与现有文献中最新技术相当。该算法基于\citet{Roditty12}提出的黑盒方法，该方法需求解至多$2k$个\emph{第二最短简单路径}（\kspp{2}）问题实例，但未给出具体实现方式。我们通过以下创新方法填补了这一空白：将标量\kspp{2}问题转化为双目标最短路径问题的实例。在网格图和道路网络上的实验表明，新算法在实践中具有极高的效率。