Dijkstra's algorithm on-line
From MaRDI portal
Publication:5463409
DOI10.1145/351827.384254zbMath1070.90509MaRDI QIDQ5463409
Dorothea Wagner, Frank Schulz, Karsten Weihe
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/351827.384254
Related Items
Graph Bisection with Pareto Optimization, Connection Scan Algorithm, Customizable Contraction Hierarchies, Temporal network optimization subject to connectivity constraints, Least expected time paths in stochastic schedule-based transit networks, Energy-optimal routes for battery electric vehicles, On the cardinality of the Pareto set in bicriteria shortest path problems, A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path, User-Constrained Multimodal Route Planning, How to find good night train connections, The Shortcut Problem – Complexity and Approximation, Engineering Route Planning Algorithms