A fast algorithm for the minimax flow problem with 01 weights

Abstract

AbstractIn this paper, we define the minimax flow problem and design an O(k · M(n,m)) time optimal algorithm for a special case of the problem in which the weights on arcs are either 0 or 1, where n is the number of vertices, m is the number of arcs, k (where 1 ≤ k ≤ m) is the number of arcs with nonzero weights, and M(n,m) is the best time bound for finding a maximum flow in a network