Author:
George Betsy,Shekhar Shashi
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. Networks 44 (August 2004)
2. Ding, Z., Guting, R.H.: Modeling temporally variable transportation networks. In: Proc. 16th Intl. Conf. on Database Systems for Advanced Applications, pp. 154–168 (2004)
3. Hall, R.: The fastest path through a network with random time-dependent travel times. Transportation Science 20, 182–188 (1986)
4. Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal 1(1), 1–11 (1993)
5. Lecture Notes in Computer Science;E. Kohler,2002
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Shortest Delay Routing Protocol Based on Time-Varying Graph for UAV Formation;2023 IEEE 23rd International Conference on Communication Technology (ICCT);2023-10-20
2. Enhanced time-expanded graph for space information network modeling;Science China Information Sciences;2022-08-25
3. Routing Vehicles on Highways by Augmenting Traffic Flow Network: A Review on Speed Up Techniques;International Conference on Intelligent Emerging Methods of Artificial Intelligence & Cloud Computing;2022
4. 60 Years of Databases (part two);PROBLEMS IN PROGRAMMING;2021-12
5. Time Aggregated Graphs;Encyclopedia of Database Systems;2018