Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
Authors:
- 29 August 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 126-138
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Characterizing the interaction between routing and MAC protocols in ad-hoc networks2002
- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power IndustryLecture Notes in Computer Science, 2001
- Shortest paths in a network with time-dependent flow speedsEuropean Journal of Operational Research, 2000
- A computational study of routing algorithms for realistic transportation networksACM Journal of Experimental Algorithmics, 1999
- Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run TimeTransportation Research Record: Journal of the Transportation Research Board, 1998
- Finding Regular Simple Paths in Graph DatabasesSIAM Journal on Computing, 1995
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Graph-theoretic methods in database theory1990
- Shortest path under rational constraintInformation Processing Letters, 1988
- Shortest paths in euclidean graphsAlgorithmica, 1986