Reports for Author "Goldberg, Andrew V." | Computer Science Department at Princeton University

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