A. Marzal and V.M. Jim'enez: "A Comparative Study of Classical Algorithms and New Approaches for the Search of the K Best Paths in a Graph", Technical Report DSIC-II/28/92, Depto. de Sistemas Inform'aticos y Computaci'on. Universidad Polit'ecnica de Valencia. Spain. (1992) 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) Self-citation (Marzal) (Correct)
....the algorithm here proposed clearly supersedes the Dreyfus algorithm, which always requires computing the K shortest paths ending at every node, and the Shier algorithm improved by Skicism and Golden, whose time complexity is quadratic with K. A more detailed comparative study can be found in [MJ92, Marz94]. 4 Final Remarks The problem of finding the K shortest paths in a graph has been stated as the resolution of a set of equations which generalize the Bellman equations for the shortest path problem. A new, simple, efficient algorithm for solving these equations has been presented. Proofs of ....
A. Marzal and V.M. Jim'enez: "A Comparative Study of Classical Algorithms and New Approaches for the Search of the K Best Paths in a Graph", Technical Report DSIC-II/28/92, Depto. de Sistemas Inform'aticos y Computaci'on. Universidad Polit'ecnica de Valencia. Spain. (1992)
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