Author:
Goldberg Andrew V.,Silverstein Craig
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan. Faster Algorithms for the Shortest Path Problem. J. Assoc. Comput. Mach., 37(2):213–223, April 1990
2. R. E. Bellman. On a Routing Problem. Quart Appl. Math., 16:87–90, 1958
3. R. Brown. Calandar Queues: A Fast O(l) Priority Queue Implementation for the Simulation Event Set Problem. Comm.ACM, 31:1220–1227, 1988
4. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. Math. Prog., 73:129–174, 1996
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献