Victor M. Jimenez, Andres Marzal  Home/Search
Context Related
| uci.edu/~eppstein/...Marzalkpath.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uci.edu/~eppstein/pubs/notmine... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) V'ictor M. Jim'enez y Andr'es Marzal Depto. de Sistemas Inform'aticos y Computaci'on Universidad Polit'ecnica de Valencia, Spain E-mail: vjimenez@dsic.upv.es Departamento de Inform'atica Universidad Jaume I, Castell'on, Spain E-mail: amarzal@inf.uji.es Abstract The problem of finding the K shortest paths in a graph is restated as the problem of resolving a set of equations that generalize the Bellman equations for the shortest path problem. A simple and fast algorithm for solving ... (Update)
Similar documents based on text: More All
0.4: Learning Extended Finite State Models for Language Translation - Vilar Vidal Amengual (1996) (Correct)
0.3: Simplifying Language Through Error-Correcting Decoding - Yjuan-Carlos Amengual.. (Correct)
0.3: Efficient Use of the Grammar Scale Factor to Classify.. - Sanchis, Jimenez, Vidal (2000) (Correct)
BibTeX entry: (Update)
V.M. Jimenez, A. Marzal. An Algorithm for Efficient Computation of K Shortest Paths. Technical Report, DSIC-II/38/94. Depto. de Sistemas Informaticos y Computacion. Universidad Politecnica de Valencia. Spain. 1994. http://citeseer.ist.psu.edu/jimenez94algorithm.html More
@misc{ jimenez94algorithm,
author = "V. Jimenez and A. Marzal",
title = "An Algorithm for Efficient Computation of K Shortest Paths",
text = "V.M. Jimenez, A. Marzal. An Algorithm for Efficient Computation of K Shortest
Paths. Technical Report, DSIC-II/38/94. Depto. de Sistemas Informaticos
y Computacion. Universidad Politecnica de Valencia. Spain. 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/jimenez94algorithm.html" }
Citations (may not include all citations):310 A Note on Two Problems in Connection with Graphs (context) - Dijkstra - 1959
72 a Routing Problem (context) - Bellman - 1958
26 An Appraisal of some Shortest-Path Algorithms (context) - Dreyfus - 1969
7 Iterative Methods for Determining the k Shortest Paths in a .. (context) - Shier - 1976
6 Calculating kth Shortest Paths (context) - Fox - 1973
3 On kth Best Policies (context) - Bellman, Kalaba - 1960
3 On Algorithms for Finding the k Shortest Paths in a Network (context) - Shier - 1979
2 Computing k-shortest path for nuclear spent fuel highway tra.. (context) - Miaou, Chin - 1991
2 Solving k-Shortest and Constrained Shortest Path Problems Ef.. (context) - Skicism, Golden - 1989
1 Data Structures and Computer Science Techniques in Operation.. (context) - Fox - 1978
1 Computing k-Shortest Path Lengths in Euclidean Networks (context) - Skicism, Golden - 1987
1 Efficient Enumeration of Sentence Hypotheses in Connected Wo.. (context) - Jim'enez, Marzal et al. - 1993
1 C'alculo de las K Mejores Soluciones a Problemas de Programa.. (context) - Marzal - 1994
1 A Comparative Study of Classical Algorithms and New Approach.. (context) - Marzal, Jim'enez - 1992
1 and E. Vidal: "A N Best Sentence Hypotheses Enumeration Algo.. (context) - Marzal - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/notmine/): More
Average-Case Ray Shooting and Minimum Weight Triangulations - Aronov, Fortune (1997) (Correct)
Quasi-Greedy Triangulations Approximating the Minimum.. - Levcopoulos, Krznaric (1996) (Correct)
Lovász's Lemma for the Three-Dimensional K-Level of Concave.. - Katoh, Tokuyama (1999) (Correct)
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