Skip to Main content Skip to Navigation
Conference papers

Space and Time Trade-Off for the k Shortest Simple Paths Problem

Ali Al Zoobi 1 David Coudert 1 Nicolas Nisse 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The k shortest simple path problem (kSSP) asks to compute a set of top-k shortest simple paths from a vertex s to a vertex t in a digraph. Yen (1971) proposed the first algorithm with the best known theoretical complexity of O(kn(m + n log n)) for a digraph with n vertices and m arcs. Since then, the problem has been widely studied from an algorithm engineering perspective, and impressive improvements have been achieved. In particular, Kurz and Mutzel (2016) proposed a sidetracks-based (SB) algorithm which is currently the fastest solution. In this work, we propose two improvements of this algorithm. We first show how to speed up the SB algorithm using dynamic updates of shortest path trees. We did experiments on some road networks of the 9th DIMAC'S challenge with up to about half a million nodes and one million arcs. Our computational results show an average speed up by a factor of 1.5 to 2 with a similar working memory consumption as SB. We then propose a second algorithm enabling to significantly reduce the working memory at the cost of an increase of the running time (up to two times slower). Our experiments on the same data set show, on average, a reduction by a factor of 1.5 to 2 of the working memory.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-02865918
Contributor : David Coudert <>
Submitted on : Friday, June 12, 2020 - 10:17:57 AM
Last modification on : Saturday, June 13, 2020 - 3:41:53 AM

File

LIPIcs-SEA-2020-18.pdf
Files produced by the author(s)

Identifiers

Citation

Ali Al Zoobi, David Coudert, Nicolas Nisse. Space and Time Trade-Off for the k Shortest Simple Paths Problem. 18th International Symposium on Experimental Algorithms (SEA), Jun 2020, Catania, Italy. pp.13, ⟨10.4230/LIPIcs.SEA.2020.18⟩. ⟨hal-02865918⟩

Share

Metrics

Record views

25

Files downloads

115