Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Selecting Problems for Algorithm Evaluation

    In this paper we address the issue of develo** test sets for computational evaluation of algorithms. We discuss both test families for comparing several algorithms and selecting one to use in an application,...

    Andrew V. Goldberg in Algorithm Engineering (1999)

  2. No Access

    Chapter and Conference Paper

    Truthful and Competitive Double Auctions

    In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder’s utility value for the item ...

    Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline in Algorithms — ESA 2002 (2002)

  3. No Access

    Chapter and Conference Paper

    The Partial Augment–Relabel Algorithm for the Maximum Flow Problem

    The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel algorithm, has been a benchmark due to...

    Andrew V. Goldberg in Algorithms - ESA 2008 (2008)

  4. No Access

    Book and Conference Proceedings

    Algorithmic Aspects in Information and Management

    5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings

    Andrew V. Goldberg, Yunhong Zhou in Lecture Notes in Computer Science (2009)

  5. No Access

    Chapter and Conference Paper

    Two-Level Push-Relabel Algorithm for the Maximum Flow Problem

    We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the...

    Andrew V. Goldberg in Algorithmic Aspects in Information and Management (2009)