Results 1 
4 of
4
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 290 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery. 1 Introduction We consider a longstudied generalization of the shortest path problem, in which not one but several short paths must be produced. The k shortest paths problem is to list the k paths connecting a given sourcedestination pair in the digraph with minimum total length. Our techniques also apply to the problem of listing all paths shorter than some given threshhold length. In the version of these problems studi...
Better kbest parsing
, 2005
"... We discuss the relevance of kbest parsing to recent applications in natural language processing, and develop efficient algorithms for kbest trees in the framework of hypergraph parsing. To demonstrate the efficiency, scalability and accuracy of these algorithms, we present experiments on Bikel’s i ..."
Abstract

Cited by 148 (16 self)
 Add to MetaCart
We discuss the relevance of kbest parsing to recent applications in natural language processing, and develop efficient algorithms for kbest trees in the framework of hypergraph parsing. To demonstrate the efficiency, scalability and accuracy of these algorithms, we present experiments on Bikel’s implementation of Collins ’ lexicalized PCFG model, and on Chiang’s CFGbased decoder for hierarchical phrasebased translation. We show in particular how the improved output of our algorithms has the potential to improve results from parse reranking systems and other applications. 1
Development and Testing of Dynamic Traffic Assignment . . .
, 1994
"... This report describes the methodologies and procedures developed through a contract to the University of Texas at Austin, in collaboration with the University of Maryland, to address these essential needs. Specifically, a simulationassignment methodology has been developed to describe user's path ..."
Abstract
 Add to MetaCart
This report describes the methodologies and procedures developed through a contract to the University of Texas at Austin, in collaboration with the University of Maryland, to address these essential needs. Specifically, a simulationassignment methodology has been developed to describe user's path choices in the network in response to realtime information, and the resulting flow patterns that propagate through the network, yielding information about overall quality of service and effectiveness, as well as localized information pointing to problem spots and opportunities for improvement. This methodology is intended for use offline for evaluation purposes, or online for prediction purpose in support of advanced traffic management functions. In additional, algorithmic procedures have been developed to determine the best paths to which users should be directed so as to optimize overall system performance. Powerful extension