| Article ID: | iaor20032956 |
| Country: | United States |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 467 |
| End Page Number: | 473 |
| Publication Date: | Mar 2002 |
| Journal: | Algorithmica |
| Authors: | Hagerup T., Erlebach Thomas |
It is shown that, for every strongly connected network in which every edge has capacity at least Delta, linear time suffices to send flow from source vertices, each with a given supply, to sink vertices, each with a given demand, provided that the total supply equals the total demand and is bounded by Delta. This problem arises in a maximum-flow algorithm of Goldberg and Rao, the binary blocking flow algorithm.