C. C. Skiscim and B. L. Golden, "Solving k-shortest and constrained shortest path problems efficiently," Annals of Operations Research, vol. 20, no. 1-4, pp. 249--282, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....running time grows exponentially in the worst case. Another approach to the RSP problem is to find the k shortest paths w.r.t. a cost function defined based on the combination of link weights and the given constraint, hoping that one of these paths is feasible and near optimal [24] 25] 26] [27]. The value of k determines the performance and overhead of this approach; if k is large, the algorithm has good performance but its computational cost is expensive. A similar approach to the k shortest paths is to implicitly enumerate all feasible paths [28] but this approach is also ....

C. C. Skiscim and B. L. Golden, "Solving k-shortest and constrained shortest path problems efficiently," Annals of Operations Research, vol. 20, no. 1-4, pp. 249--282, 1989.

....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: "Solving k-Shortest and Constrained Shortest Path Problems Efficiently", Annals of Operations Research, vol. 20, pp. 249--282. (1989) 10

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