๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simplification of the double-sweep algorithm to solve the k-shortest path problem

โœ Scribed by K.A. Rink; E.Y. Rodin; V. Sundarapandian

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
796 KB
Volume
13
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
โœ G. Ramalingam; Thomas Reps ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-ลฝ ลฝ . ลฝ . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1แŽ5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv