Finding the k shortest paths in parallel

Algorithmica (New York)

Volumn 28, Issue 2, 2000, Pages 242-254

  Ruppert, E ^a  

^a Brown Univerity   (United States)

Author keywords

Data structures; Parallel graph algorithms; Shortest paths

Indexed keywords

EID: 9144262615     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010038     Document Type: Article

References (24)

1. A. Borodin and J. E. Hopcroft. Routing, merging and sorting in parallel models of computation. Journal of Computer and System Sciences, 30:130-145, 1985.
2. G.-H. Chen and Y.-C. Hung. Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers and Operations Research, 21(2):113-118, 1994.
3. Y. L. Chen. Finding the k quickest simple paths in a network. Information Processing Letters, 50(2):89-92, Apr. 1994.
4. Y. L. Chen and Y. H. Chin. The quickest path problem. Computers and Operations Research, 17(2):153-161, 1990.
5. R. Cole. An optimally efficient selection algorithm. Information Processing Letters, 26:295-299, January 1988.
6. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770-785, August 1988.
7. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, April 1999.
8. G. D. Forney, Jr. The Viterbi algorithm. Proceedings of the IEEE, 61(3):268-278, Mar. 1973.
9. B. L. Fox. Calculating kth shortest paths. INFOR; Canadian Journal of Operational Research, 11(1):66-70, 1973.
10. G. N. Frederickson. An optimal algorithm for selection in a min-heap. Information and Computation, 104:197-214, 1993.
11. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197-208, 1982.
12. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987.
13. Y. Han, V. Y. Pan, and J. H. Reif. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Algorithmica, 17:399-415, Apr. 1997.
14. W. Hoffman and R. Pavley. A method of solution of the Nth best path problem. Journal of the ACM, 6:506-514, 1959.
15. R. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 871-941. Elsevier, Amsterdam, 1990.
16. N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for K shortest simple paths. Networks, 12:411-427, 1982.
17. N. Kumar and R. K. Ghosh. Parallel algorithm for finding first k shortest paths. Computer Science and Informatics: Journal of the Computer Society of India, 24(3):21-28, 1994.
18. R. C. Paige and C. P. Kruskal. Parallel algorithms for shortest paths problems. In Proceedings of the International Conference on Parallel Processing, pages 14-20, 1985.
19. M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In J. H. Reif, editor, Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, California, 1993.
20. E. Ruppert. Parallel algorithms for the k shortest paths and related problems. Master's thesis, University of Toronto, 1996. Available from http://www.cs.utoronto.ca/∼ruppert.
21. N. Seshadri and C.-E. W. Sundberg. List Viterbi decoding algorithms with applications. IEEE Transactions on Communications, 42(2/3/4 Part I):313-323, 1994.
22. F. K. Soong and E.-F. Huang. A tree-trellis based fast search for finding the N best sentence hypotheses in continuous speech recognition. In Proceedings of the International Conference on Acoustics, Speech and Signal Processing, volume 1, pages 705-708, 1991.
23. U. Vishkin. An optimal parallel algorithm for selection. In Advances in Computing Research, volume 4, pages 79-86. JAI Press, Greenwich, Connecticut, 1987.
24. J. Y. Yen. Finding the K shortest loopless paths. Management Science, 17(11):712-716, July 1971.