On Implementing the Push—Relabel Method for the Maximum Flow Problem
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
We study efficient implementations of the push—relabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementations: we show that the highest-level selection strategy gives better results when combined with both global and gap relabeling heuristics. We also exhibit a family of problems for which the running time of all implementations we consider is quadratic.
- On Implementing the Push—Relabel Method for the Maximum Flow Problem
Volume 19, Issue 4 , pp 390-410
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Key words. Algorithms, Network optimization, Maximum flows, Experimental evaluation.
- Industry Sectors
- Author Affiliations
- A1. Central Institute for Economics and Mathematics, Krasikova St. 32, 117418 Moscow, Russia. firstname.lastname@example.org., RU
- A2. Computer Science Department, Stanford University, Stanford, CA 94305, USA. email@example.com. Current address: NEC Research Institute Inc., 4 Independence Way, Princeton, NJ 08540, USA. firstname.lastname@example.org., US