𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time algorithm for the maximum capacity path problem

✍ Scribed by Abraham P. Punnen

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
219 KB
Volume
53
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w

A simple linear expected time algorithm
A simple linear expected time algorithm for finding a hamilton path
✍ Andrew Thomason πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A