Efficient preflow push algorithms

Authors:
R. Cerulli;M. Gentili;A. Iossa
Affiliations:
Dipartimento di Matematica ed Informatica, Universití di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy;Dipartimento di Matematica ed Informatica, Universití di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy;Dipartimento di Statistica, Probabilití e Statistiche Applicate, Universití degli Studi di Roma "La Sapienza", Piazzale A. Moro 5, 00185 Roma, Italy
Venue:
Computers and Operations Research
Year:
2008

Citing 8
Cited 2

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
An auction algorithm for the max-flow problem

Journal of Optimization Theory and Applications
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm

Information Processing Letters
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Network Flows and Matching: First DIMACS Implementation Challenge

Network Flows and Matching: First DIMACS Implementation Challenge
Analysis of Preflow Push Algorithms for Maximum Network Flow

Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science

Two-Level Push-Relabel Algorithm for the Maximum Flow Problem

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Solving maximum flow problems on real-world bipartite graphs

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Algorithms for the maximum flow problem can be grouped into two categories: augmenting path algorithms [Ford LR, Fulkerson DR. Flows in networks. Princeton University Press: Princeton, NJ: 1962], and preflow push algorithms [Goldberg AV, Tarjan RE. A new approach to the maximum flow problem. In: Proceedings of the 18th annual ACM symposium on theory of computing, 1986; p. 136-46]. Preflow push algorithms are characterized by a drawback known as ping pong effect. In this paper we present a technique that allows to avoid such an effect and can be considered as an approach combining the augmenting path and preflow push methods. An extended experimentation shows the effectiveness of the proposed approach.