𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed algorithms for the quickest path problem

✍ Scribed by Yung-Chen Hung; Gen-Huey Chen

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
955 KB
Volume
18
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The quickest path problem
The quickest path problem
✍ Y.L. Chen; Y.H. Chin πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 822 KB
On the quickest path problem
On the quickest path problem
✍ Gen-Huey Chen; Yung-Chen Hung πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 368 KB
The all-pairs quickest path problem
The all-pairs quickest path problem
✍ D.T. Lee; E. Papadopoulou πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 625 KB
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