Note on "A new bidirectional algorithm for shortest paths"
In a previous paper "A new bidirectional algorithm for shortest paths" we presented a bidirectional algorithm for finding the shortest path in a network. After the publication we designed an equivalent but shorter description for that algorithm. Due to this new description a considerably simpler proof is enabled. In this Note we discuss the new version with the related proof.
Year of publication: |
2010
|
---|---|
Authors: | Pijls, Wim ; Post, Henk |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 207.2010, 2, p. 1140-1141
|
Publisher: |
Elsevier |
Keywords: | Shortest path Bidirectional search Road network search |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A new bidirectional algorithm for shortest paths
Pijls, Wim, (2008)
-
A new bidirectional search algorithm with shortened postprocessing
Pijls, Wim, (2009)
-
Bidirectional A*: comparing balanced and symmetric heuristic methods
Pijls, Wim, (2006)
- More ...