A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS
2000
Journal of the Operations Research Society of Japan
Goldberg and Rao recelltly proposed the blocking flow methodbased on a binary length function to obtain a better algorithm for the maximllm fiow problem. The previous algorithms based on the blocking flow methed proposed by Dinic use the unit length function: every residual edge is of length 1. In this paper, we survey properties of the distance function defined by a length function and give am overvieur on the representative maxirmim fiow algorithrms proposed so far in asysternatic way by
doi:10.15807/jorsj.43.2
fatcat:cvaf6u4v45gkdmwlgems7ewbbi