Travelled to:1 × Canada
1 × Latvia
1 × Switzerland
6 × USA
Collaborated with:R.E.Tarjan P.N.Yianilos A.Fiat M.Sipser A.Marchetti-Spaccamela J.D.Hartline S.A.Plotkin G.E.Shannon M.A.Babenko A.Gupta V.Nagarajan A.R.Karlin I.Abraham D.Delling R.F.F.Werneck G.Aggarwal N.Immorlica M.Sudan Y.Chen J.Edler A.Gottlieb S.Sobti
Talks about:problem (3) intermemori (2) algorithm (2) minimum (2) auction (2) archiv (2) flow (2) find (2) cost (2) implement (1)
Person: Andrew V. Goldberg
DBLP: Goldberg:Andrew_V=
Contributed to:
20132011
2005200219881987198619851984
1998
1999Wrote 12 papers:
- ICALP-v1-2013-BabenkoGGN #algorithm #optimisation
- Algorithms for Hub Label Optimization (MAB, AVG, AG, VN), pp. 69–80.
- ICALP-v1-2011-AbrahamDFGW #algorithm
- VC-Dimension and Shortest Path Algorithms (IA, DD, AF, AVG, RFFW), pp. 690–699.
- STOC-2005-AggarwalFGHIS
- Derandomization of auctions (GA, AF, AVG, JDH, NI, MS), pp. 619–625.
- STOC-2002-FiatGHK
- Competitive generalized auctions (AF, AVG, JDH, ARK), pp. 72–81.
- STOC-1988-GoldbergT #low cost
- Finding Minimum-Cost Circulations by Canceling Negative Cycles (AVG, RET), pp. 388–397.
- STOC-1987-GoldbergPS #graph #parallel #symmetry
- Parallel Symmetry-Breaking in Sparse Graphs (AVG, SAP, GES), pp. 315–324.
- STOC-1987-GoldbergT #approximate #low cost #problem
- Solving Minimum-Cost Flow Problems by Successive Approximation (AVG, RET), pp. 7–18.
- STOC-1986-GoldbergT #approach #problem
- A New Approach to the Maximum Flow Problem (AVG, RET), pp. 136–146.
- STOC-1985-GoldbergS #ranking
- Compression and Ranking (AVG, MS), pp. 440–448.
- STOC-1984-GoldbergM #on the #problem
- On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.
- ADL-1998-GoldbergY #towards
- Towards an Archival Intermemory (AVG, PNY), pp. 147–156.
- DL-1999-ChenEGGSY #implementation #prototype
- A Prototype Implementation of Archival Intermemory (YC, JE, AVG, AG, SS, PNY), pp. 28–37.