A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Scaling algorithms for network problems
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
This paper gives algorithms for network problems that work by scaling the numeric parameters. Assume all parameters are integers. Let n, m, and N denote the number of vertices, number of edges, and largest parameter of the network, respectively. A scaling algorithm for maximum weight matching on a bipartite graph runs in O(n3% log N) time. For appropriate N this improves the traditional Hungarian method, whose most efftcient implementation is O(n(m + n log n)). The speedup results from findingdoi:10.1109/sfcs.1983.68 dblp:conf/focs/Gabow83 fatcat:tugysfkhs5apbi6bat6zsp6ieq