New Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems

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

Cached

Download Links

[dspace.mit.edu]

by James B. Orlin , Ravindra K. Ahuja

Citations:

5 - 3 self

BibTeX

@MISC{Orlin87newdistance-directed,
    author = {James B. Orlin and Ravindra K. Ahuja},
    title = {New Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems },
    year = {1987}
}

Bookmark

OpenURL

Abstract

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
391	A new approach to the maximum flow problem - Goldberg, Tarjan
387	Combinatory Optimization: Networks and Matroids - Lawler - 1976
281	Theoretical improvements in algorithmic efficiency for network flow problems - Edmonds, Karp - 1970
265	A data structure for dynamic trees - Sleator, Tarjan - 1983
111	Faster scaling algorithms for network problems - Gabow, Tarjan - 1989
103	Algorithm for solution of a problem of maximum flow in networks with power estimation - Dinic - 1970
76	Network Flow and Testing Graph Connectivity - Even, Tarjan - 1975
57	Optimum communication spanning trees - Hu - 1974
56	Solving minimum-cost flow problems by successive approximation - Goldberg, Tarjan - 1987
56	A strongly polynomial minimum cost circulation algorithm - Tardos - 1985
53	Scaling algorithms for network problems - Gabow - 1983
39	Determining the maximal flow in a network by the method of preflows - Karzanov - 1974
35	A graph theoretic approach to statistical data security - Gusfield - 1988
26	A fast and simple algorithm for the maximum flow problem - Ahuja, Orlin - 1989
22	Mathematical techniques for efficient record segmentaton in large shared databases - Eisner, Severance - 1976
21	Critical Load Factors in Two- Processor Distributed System - Stone
19	A network flow computation for project cost curves - Fulkerson - 1961
19	Scaling techniques for minimal cost network flows - ROCK - 1980
12	On the computational behavior of a polynomial-time network flow algorithm - Bland, Jensen - 1985
12	Critical path planning and scheduling - Kelley - 1961
5	Algorithms for the Minimax Transportation Problem - Ahuja - 1986
5	Maximal Flow Through a Network", Canadian - Ford, Fulkerson
4	An O(V 5/3 E 2/3 ) algorithm for the maximal flow problem - Galil - 1980
4	An O(V E log 2 E) algorithm for the maximal flow problem - Galil, Naaman - 1980
3	Algorithm for construction of maximal flow in networks with complexity of O(V 2√ E) operations - Cherkasky - 1977
3	A fast parametric flow algorithm - Gallo, Gridoriadis, et al. - 1989
2	Computational Comparison of Eight Methods for the Maximum Network Flow Problem - Cheung
2	Scheduling Transmission in a Network - Itai, Rodeh - 1985
1	Numerical Investigation with New Maximum Flow Algorithms - Ahuja, Orlin - 1987
1	Comprehensive Computer Evaluation and Enhancement of Maximum Flow Algorithms - Glover, Klingman, et al. - 1979
1	A Primal Simplex Variant for the Maximum Flow Problem - Glover, Klingman, et al.
1	On Scheduling Transmission in a Network - Gusfield - 1986
1	On the Practical Efficiency of Various Maximum Flow Algorithms - Imai
1	An O(n 3 ) Algorithm for Finding - Malhotra, Kumar, et al.
1	Parametric Network Flows - Mineka - 1972