Finding the k shortest hyperpaths

Cached

Download Links

by Lars Relund Nielsen , Kim Allan Andersen , Daniele Pretolani
Citations:17 - 4 self

Documents Related by Co-Citation

100 Directed Hypergraphs And Applications – Giorgio Gallo, Giustino Longo, Sang Nguyen, Stefano Pallottino - 1992
66 A generalization of Dijkstra’s algorithm – D E Knuth - 1977
20 Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach – G Ausiello, P G Franciosa, D Frigioni
147 Better k-best parsing – Liang Huang - 2005
2593 On the theory of dynamic programming – Richard E Bellman - 1952
7 Bicriterion shortest hyperpaths in random time-dependent networks – L R Nielsen, K A Andersen, D Pretolani - 2003
26 Coarseto-fine-grained n-best parsing and discriminative reranking – Eugene Charniak, Mark Johnson - 2005
18 An Efficient Algorithm for the n-Best-Strings Problem – Mehryar Mohri, Michael Riley - 2002
592 Automatic labeling of semantic roles – Daniel Gildea - 2002
165 Principles and implementation of deductive parsing – Stuart M. Shieber, Yves Schabes, Fernando C. N. Pereira - 1995
226 Online large-margin training of dependency parsers – Ryan Mcdonald, Koby Crammer, Fernando Pereira - 2005
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
19 Hyperpaths and shortest hyperpaths – S Nguyen, S Pallottino - 1986
12 A Directed Hypergraph Model for Random Time Dependent Shortest Paths – Daniele Pretolani - 1998
8 Route Choice in Stochastic Time-Dependent Networks – L R Nielsen - 2004
56 Parsing and hypergraphs – Dan Klein, Christopher D. Manning - 2001
375 Hierarchical phrase-based translation – David Chiang - 2007
25 Multi-level hierarchic markov processes as a framework for herd management support – Anders Ringgaard Kristensen, Anders Ringgaard Kristensen, Frederiksberg C - 2000
29 Hierarchic markov processes and their applications in replacement models – A R Kristensen - 1988