Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems

References

• Aho A. V. , Hopcroft J. E. , Ullman J. D. Data Structures and Algorithms (1983) (Addison-Wesley Publishing Company, Boston) Google Scholar
• Boneh A. , Hofri M. The Coupon-Collector Problem Revisited. (1990) . Technical report CSD-TR-952, Computer Sciences Department, Purdue University, West Lafayette, Indiana Google Scholar
• Caron R. J. , McDonald J. F. A New Approach to the Analysis of Random Methods for Detecting Necessary Linear Inequality Constraints. Mathematical Programming (1989) 43 97 102 Crossref, Google Scholar
• Denardo E. V. Dynamic Programming: Models and Applications (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Dreyfus S. E. , Law A. M. The Art and Theory of Dynamic Programming (1977) (Academic Press, New York, NY) Google Scholar
• Habbal M. B. , Koutsopoulos H. N. , Lerman S. R. A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures. Transportation Science 28:4 (1994) 292 308 Link, Google Scholar
• Kaufman D. E. , Smith R. L. Fastest Paths in Time-Dependent Networks for IVHS Applications. IVHS Journal 1:1 (1993) 1 11 Google Scholar
• Shapiro J. , Waxman J. , Nir D. Level graphs and approximate shortest path algorithms. Networks (1992) 22 691 717 Crossref, Google Scholar
• Wunderlich K. E. , Smith R. L. Large Scale Traffic Modeling for Route-Guidance Evaluation: A Case Study. (1992) . IVHS Technical report 92-08, The University of Michigan, Ann Arbor, MI Google Scholar
• Yagyu T. , Fushimi M. , Ueyama Y. , Azuma S. Quick Route-Finding Algorithm. (1993) . Technical report, Toyota Motor Corp. and Matsushita Electric Industrial Co., Ltd., Tokyo Google Scholar