𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dual simplex algorithm for finding all shortest paths

✍ Scribed by M. Florian; S. Nguyen; S. Pallottino

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
605 KB
Volume
11
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

A Randomized Parallel Algorithm for Sing
A Randomized Parallel Algorithm for Single-Source Shortest Paths
✍ Philip N Klein; Sairam Subramanian πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 179 KB

We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is ba