𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New algorithms for generalized network flows

✍ Scribed by Edith Cohen; Nimrod Megiddo

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
818 KB
Volume
64
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Balanced network flows. II. Simple augme
Balanced network flows. II. Simple augmentation algorithms
✍ Fremuth-Paeger, Christian; Jungnickel, Dieter πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k-factor problems

Balanced network flows. VII. Primal-dual
Balanced network flows. VII. Primal-dual algorithms
✍ Christian Fremuth-Paeger; Dieter Jungnickel πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

## Abstract We discuss an adaptation of the famous primal‐dual 1‐matching algorithm to balanced network flows which can be viewed as a network flow description of capacitated matching problems. This method is endowed with a sophisticated start‐up procedure which eventually makes the algorithm stron