New Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems (1987)

Cached

Download Links

by James B. Orlin , Ravindra K. Ahuja
Citations:6 - 4 self

Documents Related by Co-Citation

129 Algorithm for Solution of a Problem of Maximum Flow – E A DINIC
66 A strongly polynomial minimum cost circulation algorithm, Combinatorica 5 – E Tardos - 1985
27 A distributed algorithm for the assignment problem. Laboratory for Information and Decision Sciences, Mass – D P Bertsekas - 1979
451 Combinatorial Optimization: Networks and Matroids – E Lawler - 1976
547 An n5/2 algorithm for maximum matching in bipartite graphs – John E Hopcroft, Richard M Karp - 1973
93 Network Flow and Testing Graph Connectivity – S Even, R E Tarjan - 1975
68 Solving minimum-cost flow problems by successive approximations, extended abstract, submitted to STOC 87 – A V Goldberg - 1986
44 Efficient graph algorithms for sequential and parallel computers – A V Goldberg - 1987
85 Algorithm 360: Shortest-path forest with topological ordering – R B Dial - 1969
67 Finding minimum-cost circulations by canceling negative cycles – A Goldberg, R Tarjan - 1989
31 DUAL COORDINATE STEP METHODS FOR LINEAR NETWORK FLOW PROBLEMS – Dimitri P. Bertsekas, Jonathan Eckstein - 1988
48 Finding minimum-cost circulations by successive approximation – A V Goldberg, R E Tarjan - 1990
29 Distributed asynchronous relaxation methods for linear network flow problems – D P Bertsekas - 1986
60 Scaling Algorithms for Network Problems – Harold N. Gabow - 1985
297 Tarjan, A data structure for dynamic trees – D D Sleator, R E - 1983
514 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
23 A new max-flow algorithm – A V Goldberg - 1985
8 Fibonacci heaps and their uses in network optimization algorithms – Tarjan - 1984
8 Routing and scheduling of vehicles and crews – L D Bodin, B L Golden, A A Assad, M O Ball - 1983