팔로우
Andrew V. Goldberg
Andrew V. Goldberg
Senior Principal Scientist, Amazon.com, Inc.
alum.mit.edu의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
A new approach to the maximum flow problem
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 35 (4), 921-940, 1988
32881988
Shortest paths algorithms: Theory and experimental evaluation
BV Cherkassky, AV Goldberg, T Radzik
Mathematical programming 73 (2), 129-174, 1996
13041996
Computing the shortest path: A* search meets graph theory
AV Goldberg, C Harrelson
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
12372005
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
12002009
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ...
Algorithm engineering: Selected results and surveys, 19-80, 2016
8852016
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
6661998
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
6661998
Beyond the flow decomposition barrier
AV Goldberg, S Rao
Journal of the ACM (JACM) 45 (5), 783-797, 1998
6661998
On implementing the push—relabel method for the maximum flow problem
BV Cherkassky, AV Goldberg
Algorithmica 19, 390-410, 1997
6101997
An efficient implementation of a scaling minimum-cost flow algorithm
AV Goldberg
Journal of algorithms 22 (1), 1-29, 1997
5441997
Finding a maximum density subgraph
AV Goldberg
University of California, 1984
5261984
Finding minimum-cost circulations by canceling negative cycles
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 36 (4), 873-886, 1989
4801989
Parallel symmetry-breaking in sparse graphs
A Goldberg, S Plotkin, G Shannon
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
4271987
Competitive auctions for multiple digital goods
AV Goldberg, JD Hartline
European Symposium on Algorithms, 416-427, 2001
4132001
Competitive auctions and digital goods
AW Andrew V. Goldberg, Jason D. Hartline
SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete …, 2001
413*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
3962006
Competitive auctions
AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright
Games and Economic Behavior 55 (2), 242-269, 2006
3932006
Network decomposition and locality in distributed computation
B Awerbuch, AV Goldberg, M Luby, SA Plotkin
FOCS 30, 364-369, 1989
3761989
Finding minimum-cost circulations by successive approximation
AV Goldberg, RE Tarjan
Mathematics of Operations Research 15 (3), 430-466, 1990
3691990
Finding minimum-cost circulations by successive approximation
AV Goldberg, RE Tarjan
Mathematics of Operations Research 15 (3), 430-466, 1990
3691990
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20