A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Graph Partitioning with the Party Library: Helpful-Sets in Practice
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
During recent years, impressive speed-up techniques for Dijkstra's have been developed. Unfortunately, the most advanced techniques use bidirectional search, which makes it hard to use them in scenarios where a backward search is prohibited. Even worse, such scenarios are widely spread (e.g., timetable-information systems or time-dependent networks). In this work, we present a unidirectional speed-up technique, which competes with bidirectional approaches. Moreover, we show how to exploit the advantage of unidirectional routing for fast exact queries in timetable information systems and for fast approximative queries in time-dependent scenarios. By running experiments on several inputs other than road networks, we show that our approach is very robust to the input.