𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Faster parametric shortest path and minimum-balance algorithms

✍ Scribed by Neal E. Young; Robert E. Tarjant; James B. Orlin

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
1016 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster Shortest-Path Algorithms for Plan
Faster Shortest-Path Algorithms for Planar Graphs
✍ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi

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

Shortest path algorithms using dynamic b
Shortest path algorithms using dynamic breadth-first search
✍ Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 1022 KB

A new O(nm) label-correcting algorithm is presented for finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs or finding a directed cycle of negative length. In this algorithm, a node is scanned on the k-th scanning step only if its "label depth"-i.e., the le