Andrew V. Goldberg - Concepedia

Author

Andrew V. Goldberg

Also Known As

A Goldberg, A V Goldberg, A. Goldberg, A. V. Goldberg, A.V. Goldberg, Andrew Goldberg, Andrew V Goldberg, Andrew V. Goldberg, Goldberg, Andrew, Goldberg, Andrew V.

183

Publications

15.2K

Citations

H-Index

127

Concepts

All Affiliations

Stanford University Princeton University Microsoft (United States)Tel Aviv University Massachusetts Institute of Technology

About

Andrew V. Goldberg is an author at Stanford University specializing in engineering, computer science, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	44	79	10.9K
2	Business	19	23	2K
3	Education	12	12	3.4K
4	Management	2	2	397
5	Natural Sciences	1	1	11

Andrew V. Goldberg

Publications

12.2K

Citations

H-Index

Page 1

	Year	Citations
A new approach to the maximum-flow problem Andrew V. Goldberg, Robert E. Tarjan Journal of the ACM Mathematical ProgrammingNumerical AnalysisDirected GraphEngineeringMaximum-flow Problem	1988	1.9K
Quincy Michael Isard, Vijayan Prabhakaran, Jon Currey, Job SchedulerCluster ComputingEngineeringEdge ComputingFine-grain Resource	2009	851
Shortest paths algorithms: Theory and experimental evaluation Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik Mathematical Programming Shortest Paths AlgorithmsPath PlanningNetwork Routing AlgorithmEngineeringRoute Planning	1996	737
Computing the shortest path: A search meets graph theory Andrew V. Goldberg, Chris Harrelson Symposium on Discrete Algorithms Mathematical ProgrammingEngineeringShortest Path AlgorithmsNetwork AnalysisEducation	2005	725
Beyond the flow decomposition barrier Andrew V. Goldberg, Satish Rao Journal of the ACM Mathematical ProgrammingResidual Arc CapacitiesBranch-and-bound AlgorithmEngineeringPlanar Graph	1998	470
On Implementing the Push—Relabel Method for the Maximum Flow Problem Boris V. Cherkassky, Andrew V. Goldberg Algorithmica Numerical AnalysisEngineeringMaximum Flow ProblemOptimization ProblemPath Problems	1997	370
Finding a Maximum Density Subgraph Andrew V. Goldberg UC Berkeley Graph TheoryMaximum Density SubgraphExtremal CombinatoricsHypergraph TheoryExtremal Graph Theory	1984	369
Finding minimum-cost circulations by canceling negative cycles Andrew V. Goldberg, Robert E. Tarjan Journal of the ACM Mathematical ProgrammingNegative CostEngineeringAnalysis Of AlgorithmComputational Complexity	1989	340
Finding Minimum-Cost Circulations by Successive Approximation Andrew V. Goldberg, Robert E. Tarjan Mathematics of Operations Research Mathematical ProgrammingNumerical AnalysisBranch-and-bound AlgorithmEngineeringSuccessive Approximation	1990	337
A new approach to the maximum flow problem Andrew V. Goldberg, Robert E. Tarjan Numerical AnalysisMathematical ProgrammingEngineeringComputational ComplexityDiscrete Optimization	1986	326

Page 1