A Comparative Study of k-Shortest Path Algorithms (1995)

Cached

Download Links

by A. W. Brander , M. C. Sinclair
Venue:In Proc. of 11th UK Performance Engineering Workshop
Citations:17 - 0 self

Documents Related by Co-Citation

289 Finding the k Shortest Paths – David Eppstein - 1997
690 OSPF Version 2 – J Moy - 1998
151 Finding the k shortest loopless paths in a network – J Y Yen - 1971
79 A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem – E L Lawler - 1972
5 Comment on computing the k shortest paths in a graph – Eugene L Lawler - 1977
6 On computing sets of shortest paths in a graph – Edward Minieka - 1974
8533 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest - 1989
141 QoS Routing Mechanisms and OSPF Extensions – G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda - 1997
93 Vickrey Prices and Shortest Paths: What is an edge worth? – John Hershberger, Subhash Suri - 2001
822 A Note on Two Problems in Connection with Graphs – E W Dijkstra - 1959
94 Disjoint paths in a network – J Suurballe - 1974
33 An efficient algorithm for K shortest simple paths – N Katoh, T Ibaraki, H Mine - 1982
9 Implementation of algorithms for k shortest loopless paths – A Perko - 1986
8 Method and system for natural language translation. U.S. patent #5.477.451 – J Cocke Brown, S A Della Pietra, V J Della Pietra, F Jelinek, J Lai, R L Mercer - 1995
26 Coarseto-fine-grained n-best parsing and discriminative reranking – Eugene Charniak, Mark Johnson - 2005
17 Finding the k shortest hyperpaths – Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
37 Representation-based just-in-time specialization and the Psyco prototype for Python – Armin Rigo - 2004
46 K.: Compositional semantics with lexicalized TreeAdjoining Grammar (LTAG): How much underspecification is necessary – A K Joshi, Vijay-Shanker - 1999
27 Joint parsing and semantic role labeling – Charles Sutton, Andrew Mccallum - 2005