Finding a Feasible Flow in a Strongly Connected Network
| dc.creator | Haeupler, Bernhard | |
| dc.creator | Tarjan, Robert E. | |
| dc.date | 2007-11-17 | |
| dc.date | 2007-12-03 | |
| dc.date.accessioned | 2026-07-07T08:46:19Z | |
| dc.date.available | 2026-07-07T08:46:19Z | |
| dc.description | We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method by a constant factor. Erlebach and Hagerup gave an linear-time feasible flow algorithm. We give an arguably simpler one. | |
| dc.description | 4 pages, submitted to Operations Research Letters, minor updates: typos corrected, speed-up = improvement of the worst-case time bound | |
| dc.identifier | https://arxiv.org/abs/0711.2710 | |
| dc.identifier | http://arxiv.org/abs/0711.2710 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143213 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Finding a Feasible Flow in a Strongly Connected Network | |
| dc.type | text |