𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An empirical investigation of some bicriterion shortest path algorithms

✍ Scribed by J. Brumbaugh-Smith; D. Shier

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
646 KB
Volume
43
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the ranking of shortest
An algorithm for the ranking of shortest paths
✍ JosΓ©Augusto Azevedo; Maria EmΓ­lia O. Santos Costa; Joaquim JoΓ£o E.R. Silvestre M πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 631 KB
An efficient implementation of an algori
An efficient implementation of an algorithm for findingK shortest simple paths
✍ Hadjiconstantinou, E.; Christofides, N. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 263 KB πŸ‘ 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

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