Author:
Li Lei,Zhou Xiaofang,Zheng Kevin
Publisher
Springer International Publishing
Reference23 articles.
1. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
2. Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165. Society for Industrial and Applied Mathematics (2005)
3. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 10. IEEE (2006)
4. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advancesin Database Technology, pp. 205–216. ACM (2008)
5. Chabini, I.: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Trans. Res. Record: J. Transp. Res. Board 1645, 170–175 (1998)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Time-dependent route scheduling on road networks;SIGSPATIAL Special;2018-06-05
2. Reverse k Nearest Neighbor Queries in Time-Dependent Road Networks;2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS);2018-06
3. Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory;The VLDB Journal;2018-03-21
4. Minimal on-road time route scheduling on time-dependent graphs;Proceedings of the VLDB Endowment;2017-08