The Partial Augment-Relabel Algorithm for the Maximum Flow Problem

Abstract. 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.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Andrew V. Goldberg
• Keywords: Algorithms, Classical Optimization Problem, ESA 2008, Maximum Flow Problem, Robust Performance