## The Partial Augment–Relabel Algorithm for the Maximum Flow Problem

by
Andrew V. Goldberg

Venue: | In Proc. 16th Annual European Symposium Algorithms |

Citations: | 2 - 1 self |

### BibTeX

@INPROCEEDINGS{Goldberg_thepartial,

author = {Andrew V. Goldberg},

title = {The Partial Augment–Relabel Algorithm for the Maximum Flow Problem},

booktitle = {In Proc. 16th Annual European Symposium Algorithms},

year = {},

pages = {466--477}

}

### OpenURL

### Abstract

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