Andrew V. Goldberg
Andrew V. Goldberg
Senior Principal Scientist, Amazon.com, Inc.
Email verificata su alum.mit.edu - Home page
TitoloCitata daAnno
A new approach to the maximum flow problem
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 35 (4), 921-940, 1988
27421988
Shortest paths algorithms: Theory and experimental evaluation
BV Cherkassky, AV Goldberg, T Radzik
Mathematical programming 73 (2), 129-174, 1996
12271996
Computing the shortest path: A* search meets graph theory
AV Goldberg, C Harrelson
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
9022005
Quincy: fair scheduling for distributed computing clusters
M Isard, V Prabhakaran, J Currey, U Wieder, K Talwar, A Goldberg
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles …, 2009
8962009
Beyond the flow decomposition barrier
AV Goldberg, S Rao, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
5351998
Beyond the flow decomposition barrier
AV Goldberg, S Rao, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
5351998
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
5351998
On implementing the push—relabel method for the maximum flow problem
BV Cherkassky, AV Goldberg
Algorithmica 19 (4), 390-410, 1997
5161997
An efficient implementation of a scaling minimum-cost flow algorithm
AV Goldberg
Journal of algorithms 22 (1), 1-29, 1997
4401997
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ...
Algorithm engineering, 19-80, 2016
4282016
Finding minimum-cost circulations by canceling negative cycles
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 36 (4), 873-886, 1989
3821989
Parallel symmetry-breaking in sparse graphs
A Goldberg, S Plotkin, G Shannon
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
3651987
Competitive auctions and digital goods
AV Goldberg, JD Hartline, A Wright
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
352*2001
Reach for A∗: Efficient point-to-point shortest path algorithms
AV Goldberg, H Kaplan, RF Werneck
Workshop on Algorithm Engineering & Experiments, 129-143, 2006
3462006
Finding a maximum density subgraph
AV Goldberg
University of California, 1984
3081984
Finding minimum-cost circulations by successive approximation
AV Goldberg, RE Tarjan
Mathematics of Operations Research 15 (3), 430-466, 1990
3021990
Finding minimum-cost circulations by successive approximation
AV Goldberg, RE Tarjan
Mathematics of Operations Research 15 (3), 430-466, 1990
3021990
Competitive auctions
AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright
Games and Economic Behavior 55 (2), 242-269, 2006
3002006
On memory-bound functions for fighting spam
C Dwork, A Goldberg, M Naor
Annual International Cryptology Conference, 426-444, 2003
2932003
Solving minimum-cost flow problems by successive approximation
A Goldberg, R Tarjan
Proceedings of the nineteenth annual ACM symposium on Theory of computing, 7-18, 1987
2911987
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20