The Partial Augment–Relabel Algorithm for the Maximum Flow Problem

  • Andrew V. Goldberg
Conference paper

DOI: 10.1007/978-3-540-87744-8_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)
Cite this paper as:
Goldberg A.V. (2008) The Partial Augment–Relabel Algorithm for the Maximum Flow Problem. In: Halperin D., Mehlhorn K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Andrew V. Goldberg
    • 1
  1. 1.Microsoft Research – Silicon ValleyMountain View

Personalised recommendations