A. Marzal: "C'alculo de las K Mejores Soluciones a Problemas de Programaci'on Din'amica". PhD Dissertation (in Spanish). Departamento de Sistemas Inform'aticos y Computaci'on. Universidad Polit'ecnica de Valencia. Spain. (1994)  Home/Search   Document Not in Database   Summary   Related Articles

.... at every node v 2 V , with a time cost of O (A jV j Delta K Delta log D) In contrast, best case time complexity of the algorithm is Omega Gamma A K) Experimental results with a variety of graphs show that the algorithm behaviour is typically closer to the best case than to the worst one [Marz94]. The efficiency of the Recursive Enumeration Algorithm is particularly relevant when dealing with multi stage graphs, where paths are composed 8 of one node per stage and, for this reason, the cost of the second stage of the algorithm depends on the number of stages but not on the number of ....

....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 ....

[Article contains additional citation context not shown here]

A. Marzal: "C'alculo de las K Mejores Soluciones a Problemas de Programaci'on Din'amica". PhD Dissertation (in Spanish). Departamento de Sistemas Inform'aticos y Computaci'on. Universidad Polit'ecnica de Valencia. Spain. (1994)

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