{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T11:31:17Z","timestamp":1791113477427,"version":"4.1.0"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1989,10]]},"abstract":"<jats:p>Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields a very simple algorithm running in $O(n^3 )$ time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of $O(nm\\log (n^2 \/m)$ on m-arc networks. Ahuja and Orlin developed a variant of Goldberg\u2019s algorithm that uses scaling and runs in $O(nm + (n^2 \\log U)$ time on networks with integer arc capacities bounded by U. In this paper possible improvements to the Ahuja-Orlin algorithm are explored. First, an improved running time of $O(nm + n^2 \\log U\/\\log \\log U)$ is obtained by using a nonconstant scaling factor. Second, an even better bound of $O(nm + n^2 (\\log U)^{1\/2} )$ is obtained by combining the Ahuja-Orlin algorithm with the wave algorithm of Tarjan. Third, it is shown that the use of dynamic trees in the latter algorithm reduces the running time to $O(nm\\log (({n \/ m})(\\log U)^{{1 \/ 2}} + 2))$. This result shows that the combined use of three different techniques, results in speed not obtained by using any of the techniques alone. The above bounds are all for a unit-cost random access machine. Also considered is a semilogarithmic computation model in which the bounds increase by an additive term of $O(m\\log _n U)$, which is the time needed to read the input in the model.<\/jats:p>","DOI":"10.1137\/0218065","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:32:44Z","timestamp":1109226764000},"page":"939-954","source":"Crossref","is-referenced-by-count":85,"title":["Improved Time Bounds for the Maximum Flow Problem"],"prefix":"10.1137","volume":"18","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.5.748"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585705"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, S. N. Maheshwari,  Analysis of preflow push algorithms for maximum network flow, Dept. of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India,  1987","DOI":"10.1007\/3-540-50517-2_69"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"R5","volume-title":"Graph algorithms","author":"Even Shimon","year":"1979"},{"key":"R6","volume-title":"Flows in networks","author":"Ford, Jr. L. R.","year":"1962"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"R8","unstructured":"A. V. Goldberg,  A New Max-Flow Algorithm, Tech. Report, MIT\/LCS\/TM-291, Laboratory for Computer Science, Mass. Inst. of Technology, Cambridge, MA,  1985"},{"key":"R9","unstructured":"A. V. Goldberg, Ph.D. Thesis,  Efficient Graph Algorithms for Sequential and Parallel Computers, Mass. Inst. of Technology, Cambridge, MA,  1987"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"R12","first-page":"434","volume":"15","author":"Karzanov A. V.","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"R13","volume-title":"Combinatorial optimization: networks and matroids","author":"Lawler Eugene L.","year":"1976"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90016-9"},{"key":"R15","volume-title":"Combinatorial optimization: algorithms and complexity","author":"Papadimitriou Christos H.","year":"1982"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"R17","unstructured":"D. D. Sleator,  An  O(nmlogn) algorithm for maximum network flow, Tech. Report, STAN-CS-80-831, Computer Science Dept., Stanford University, Stanford, CA,  1980"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90076-2"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0218065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:45:07Z","timestamp":1787337907000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0218065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["10.1137\/0218065"],"URL":"https:\/\/doi.org\/10.1137\/0218065","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}