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

Optimized k-shortest-paths algorithm for facility restoration

โœ Scribed by M. H. Macgregor; W. D. Grover

Book ID
112210726
Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
735 KB
Volume
24
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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