Author:
Li JiaJia,Wang Yannan,Zhu Rui,Zhang Jing,Guo Na
Publisher
Springer Nature Singapore
Reference23 articles.
1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) Algorithms – ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 24–35. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_4
2. Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: WWW 2014, pp. 237–248. ACM (2014)
3. Board, T.: Transportation research board special report 309: (2012)
4. Chen, L., Shang, S., Yao, B., Li, J.: Pay your trip for traffic congestion: dynamic pricing in traffic-aware road networks. In: IAAI 2020, pp. 582–589. AAAI (2020)
5. Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. JMAA 14(3), 493–498 (1966)