#### Filter Results:

- Full text PDF available (73)

#### Publication Year

1984

2018

- This year (1)
- Last 5 years (30)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrew V. Goldberg, Robert E. Tarjan
- STOC
- 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â€¦ (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â€¦ (More)

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

We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based on landmarks and the triangle inequality. Our algorithms computeâ€¦ (More)

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â€¦ (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â€¦ (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â€¦ (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â€¦ (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.,â€¦ (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â€¦ (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â€¦ (More)