Reverse maximum flow problem under the Chebyshev distance

Given a network G(V,A,u) with two specific nodes, a source nods s and a sink node t, the reverse maximum flow problem is to increase the capacity of some arcs (I,j) as little as possible so that the maximum flow value from s to in the modified network is lower is lower bounded by a prescribed value v(0) . in this paper, we study the reverse maximum flow problem under the chebyshev distance and present an efficient alogrithm to solve the problem.

کلیدواژه ها:

Maximum flow problem ، reverse roblem ، chebyshev distance