Global price updates help

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 4, 1997, Pages 551-572

  Goldberg, Andrew V ^a   Kennedy, Robert ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

Assignment problem; Bipartite matching; Cost scaling; Dual update; Push relabel algorithm; Zero one flow

Indexed keywords

EID: 6144274132     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194281185     Document Type: Article

References (20)

1. R. J. ANDERSON AND J. C. SETUBAL, Goldberg's algorithm for the maximum flow in perspective: A computational study, in Network Flows and Matching: First DIMACS Implementation Challenge, D. S. Johnson and C. C. McGeoch, eds., AMS, Providence, RI, 1993, pp. 1-18.
2. U. DERIGS AND W. MEIER, Implementing Goldberg's max-flow algorithm - A computational investigation, ZOR - Math. Methods Oper. Res., 33 (1989), pp. 383-403.
3. R. B. DIAL, Algorithm 360: Shortest path forest with topological ordering, Comm. ACM, 12 (1969), pp. 632-633.
4. E. A. DINIC, Algorithm for solution of a problem of maximum flow in networks with power estimation, Soviet Math. Dokl., 11 (1970), pp. 1277-1280.
5. S. EVEN AND R. E. TARJAN, Network flow and testing graph connectivity, SIAM J. Comput., 4 (1975), pp. 507-518.
6. T. FEDER AND R. MOTWANI, Clique partitions, graph compression and speeding-up algorithms, in Proc. 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, ACM, New York, 1991, pp. 123-133.
7. L. R. FORD, JR. AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
8. H. N. GABOW AND R. E. TARJAN, Almost-optimal speed-ups of algorithms for matching and related problems, in Proc. 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, ACM, New York, 1988, pp. 514-527.
9. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., 18 (1989), pp. 1013-1036.
10. A. V. GOLDBERG, Efficient Graph Algorithms for Sequential and Parallel Computers, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1987. (Also available as Technical Report TR-374, Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1987.)
11. A. V. GOLDBERG, An efficient implementation of a scaling minimum-cost flow algorithm, in Proc. 3rd Integer Prog. and Combinatorial Opt. Conf., Erice, Italy, 1993, pp. 251-266.
12. A. V. GOLDBERG, S. A. PLOTKIN, AND P. M. VAIDYA, Sublinear-time parallel algorithms for matching and related problems, J. Algorithms, 14 (1993), pp. 180-213.
13. A. V. GOLDBERG AND R. E. TARJAN, A new approach to the maximum flow problem, J. Assoc. Comput. Mach., 35 (1988), pp. 921-940.
14. A. V. GOLDBERG AND R. E. TARJAN, Finding minimum-cost circulations by successive approximation, Math. Oper. Res., 15 (1990), pp. 430-466.
15. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225-231.
16. A. V. KARZANOV, On finding maximum flows in networks with special structure and some applications, in Matematicheskie Voprosy Upravleniya Proizvodstvom, vol. 5, Moscow State University Press, Moscow, 1973 (in Russian).
17. A. V. KARZANOV, The exact time bound for a maximum flow algorithm applied to the set representatives problem, in Problems in Cybernetics, vol. 5, Nauka, Moscow, 1973, pp. 66-70 (in Russian).
18. H. W. KUHN, The Hungarian method for the assignment problem, Naval Res. Logist. Quart., 2 (1955), pp. 83-97.
19. Q. C. NGUYEN AND V. VENKATESWARAN, Implementations of Goldberg-Tarjan maximum flow algorithm, in Network Flows and Matching: First DIMACS Implementation Challenge, D. S. Johnson and C. C. McGeoch, eds., AMS, Providence, RI, 1993, pp. 19-42.
20. J. B. ORLIN AND R. K. AHUJA, New scaling algorithms for the assignment and minimum cycle mean problems, Math. Programming, 54 (1992), pp. 41-56.