Andrew Vladislav Goldberg (born 1960) is an American computer scientist working primarily on design, analysis, and experimental evaluation of algorithms.
After earning a master's degree at the University of California, Berkeley, he returned to MIT with funding from a prestigious Hertz Fellowship, finishing his doctorate there in 1987 with a thesis on the Efficient graph algorithms for sequential and parallel computers[3] supervised by Charles E.
[citation needed] Goldberg is best known for his research in the design and analysis of algorithms for graphs and networks, and particularly for his work on the maximum flow problem[GT88][CG97][GR98] and shortest path problem,[CGR96][GH05] including the discovery of the push–relabel maximum flow algorithm.
Tucker Prize of the Mathematical Optimization Society,[4] 1988 National Science Foundation (NSF) Presidential Young Investigator Award, 1991 ONR Young Investigator Award, and 2011 INFORMS Optimization Society Farkas Prize.
Goldberg was nominated a Fellow of the Association for Computing Machinery (ACM) in 2009 "for contributions to fundamental theoretical and practical problems in the design and analysis of algorithms.