Algorithms - ESA 2008

Volume 5193 of the series Lecture Notes in Computer Science pp 466-477

The Partial Augment–Relabel Algorithm for the Maximum Flow Problem

  • Andrew V. GoldbergAffiliated withMicrosoft Research – Silicon Valley

* Final gross prices may vary according to local VAT.

Get Access


The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel algorithm, has been a benchmark due to its robust performance. We propose another variant of the push-relabel method, the partial augment-relabel (PAR) algorithm. Our experiments show that PAR is very robust. It outperforms HI-PR on all problem families tested, asymptotically in some cases.