Author:
Dehne Frank,Omran Masoud T.,Sack Jörg-Rüdiger
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. Agarwal, P.K., Schwarzkopf, O., Sharir, M.: The overlay of lower envelopes and its applications. Discrete Comput. Geom. 15(1), 1–13 (1996)
2. Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutellà, M.G.: Minimum time and minimum cost-path problems in street networks with periodic traffic lights. Transp. Sci. 36(3), 326–336 (2002)
3. Bertsekas, D.P.: A simple and fast label correcting algorithm for shortest paths. Networks 23(7), 703–709 (1993)
4. Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. Electron. Notes Theor. Comput. Sci. 92, 3–15 (2004)
5. Chon, H.D., Agrawal, D., El Abbadi, A.: Fates: finding a time dependent shortest path. In: MDM ’03: Proceedings of the 4th International Conference on Mobile Data Management, pp. 165–180. Springer, London (2003)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献