C. C. Skicism and B. L. Golden: "Computing k-Shortest Path Lengths in Euclidean Networks ", Networks, vol. 17, pp. 341--352. (1987) Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Algorithm for Efficient Computation of K Shortest Paths - Jimenez, Marzal (1994) (1 citation) (Correct)
....length of the shortest path from every node to t is computed; then these values are used as an exact estimation of the best way to complete a partial path starting at s. In practice, this improvement dramatically speeds up Shier s algorithm, but the computational complexity remains quadratic in K [SK87, SK89, MC91]. A new algorithm for the generation of the K Best Sentence Hypotheses for a given utterance was recently proposed by the authors in the field of Automatic Speech Recognition [JM92, JMV93] In this paper, we present this algorithm as a general procedure for the K shortest paths problem, and ....
C. C. Skicism and B. L. Golden: "Computing k-Shortest Path Lengths in Euclidean Networks ", Networks, vol. 17, pp. 341--352. (1987)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC