-
TR-530-96 -
Expected Performance of Dijkstra's Shortest Path Algorithm
(1996-10-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-050-86 -
A New Approach to the Maximum Flow Problem
(1986-07-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-081-87 -
Solving Minimum-Cost Flow Problems by Successive Approximation
(1987-02-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-106-87 -
Finding Minimum-Cost Circulations by Successive Approximation
(1987-07-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-107-87 -
Finding Minimum-Cost Circulations by Canceling Negative Cycles
(1987-07-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-164-88 -
Finding Minimum-Cost Flows by Double Scaling
(1988-06-00)
Ahuja, Ravindra K. / Orlin, James B. / Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-186-88 -
A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network
(1988-10-00)
Tarjan, Robert E. / Goldberg, Andrew V.
-
TR-193-88 -
Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem
(1988-10-00)
Tarjan, Robert E. / Goldberg, Andrew V. / Grigoriadis, Michael D.
-
TR-216-89 -
Network Flow Algorithms
(1989-03-00)
Tarjan, Robert E. / Goldberg, Andrew V. / Tardos, Eva