Funder
National Natural Science Foundation of China
Australian Research Council
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference58 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. Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endow. 5(5), 406–417 (2012)
4. 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’06, p. 10. IEEE (2006)
5. 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: Advances in Database Technology, pp. 205–216. ACM (2008)
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Just-In-Time Framework for Continuous Routing;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
2. Congestion-Mitigating Spatiotemporal Routing in Road Networks;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
3. Managing the Future: Route Planning Influence Evaluation in Transportation Systems;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
4. Approximate Skyline Index for Constrained Shortest Pathfinding with Theoretical Guarantee;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
5. An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs;International Journal of Intelligent Systems;2023-11-21