As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple path introduced locality is implicit in ...

We develop some fundamental theory for this problem, upon which we design an efficient heuristic. Specifically, we prove that the gap between the optimal number of paths and a known upper bound is ...