#### Filter Results:

- Full text PDF available (119)

#### Publication Year

1984

2017

- This year (4)
- Last 5 years (33)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andrew V. Goldberg, Robert E. Tarjan
- J. ACM
- 1986

All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the <italic>preflow</italic> concept of Karzanov is introduced. A… (More)

This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations close to their data is crucial for performance, is increasingly common and arises in systems such as MapReduce, Hadoop, and Dryad as well as many grid-computing environments. We… (More)

- Andrew V. Goldberg, Chris Harrelson
- SODA
- 2005

We study the problem of finding a shortest path between two vertices in a directed graph. This is an important problem with many applications, including that of computing driving directions. We allow preprocessing the graph using a linear amount of extra space to store auxiliary information, and using this information to answer shortest path queries… (More)

- Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
- Math. Program.
- 1994

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and… (More)

- Andrew V. Goldberg, Satish Rao
- FOCS
- 1997

We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our approach leads to an <italic>O</italic>(min(<italic>n</italic><supscrpt>2/3</supscrpt>, <italic>m</italic><supscrpt>1/2</supscrpt>)<italic>m</italic>… (More)

- Andrew V. Goldberg, Robert E. Tarjan
- STOC
- 1988

A classical algorithm for finding a minimum-cost circulation consists of repeatedly finding a residual cycle of negative cost and <italic>canceling</italic> it by pushing enough flow around the cycle to saturate an arc. We show that a judicious choice of cycles for canceling leads to a polynomial bound on the number of iterations in this algorithm. This… (More)

- Andrew V. Goldberg
- IPCO
- 1993

The scaling push-relabel method is an important theoretical development in the area of minimum-cost ow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was… (More)

- Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright
- Games and Economic Behavior
- 2006

We study a class of single-round, sealed-bid auctions for items in unlimited supply, such as digital goods. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e., encourages buyers to bid their utility) and yields profit that is roughly within a constant factor of the profit of optimal fixed pricing for all inputs. We… (More)

- Boris V. Cherkassky, Andrew V. Goldberg
- Algorithmica
- 1995

We study efficient implementations of the push—relabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementations: we show that the highest-level selection strategy gives better results when combined… (More)

- Andrew V. Goldberg, Jason D. Hartline, Andrew Wright
- SODA
- 2001

We study a class of single round, sealed bid auctions for items in unlimited supply such as digital goods. We focus on auctions that are truthful and competitive. Truthful auctions encourage bidders to bid their utility; competitive auctions yield revenue within a constant factor of the revenue for optimal fixed pricing. We show that for any truthful… (More)