✦ LIBER ✦

Computational study of an improved shortest path algorithm

✍ Scribed by Fred Glover; Randy Glover; Darwin Klingman

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 649 KB
Volume: 14
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230140103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for K shortest si

An efficient algorithm for K shortest simple paths

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An Optimal Shortest Path Parallel Algori

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

An algorithm for the resource constraine

An algorithm for the resource constrained shortest path problem

✍ J. E. Beasley; N. Christofides 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 812 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

Implementation of algorithms for K short

Implementation of algorithms for K shortest loopless paths

✍ Aarni Perko 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally