Author:
Cherkassky Boris V.,Goldberg Andrew V.,Radzik Tomasz
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference29 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) (1990) 213–223.
2. R.E. Bellman, “On a routing problem”,Quart. Appl. Math. 16 (1958) 87–90.
3. P. van Emde Boas, R. Kaas and E. Zijlstra, “Design and implementation of an efficient priority queue”,Math. Syst. Theory 10 (1977) 99–127.
4. T.H. Cormen, C.E. Leiserson and R.L. Rivest,Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
5. E.V. Denardo and B.L. Fox, “Shortest-route methods: 1. Reaching, pruning, and buckets”,Operations Research 27 (1979) 161–186.
Cited by
386 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献