Shortest paths in Euclidean graphs
Algorithmica
Shortest path under rational constraint
Information Processing Letters
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Enabling routes as context in mobile services
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Write it recursively: a generic framework for optimal path queries
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Complexity results on labeled shortest path problems from wireless routing metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
A label correcting algorithm for the shortest path problem on a multi-modal route network
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We describe and analyze empirically an implementation of some generalizations of Dijkstra's algorithm for shortest paths in graphs. The implementation formed a part of the TRANSIMS project at the Los Alamos National Laboratory. Besides offering the first implementation of the shortest path algorithm with regular language constraints, our code also solves problems with time-dependent edge delays in a quite general first-in-first-out model.We describe some details of our implementation and then analyze the behavior of the algorithm on real but extremely large transportation networks. Even though the questions we consider in our experiments are fundamental and natural, it appears that they have not been carefully examined before. A methodological contribution of the present work is the use of formal statistical methods to analyze the behaviour of our algorithms. Although the statistical methods employed are simple, they provide a possibly novel approach to the experimental analysis of algorithms.Our results provide evidence for our claims of efficiency of the algorithms described in a very practical setting.