Skip to main content

3 Result(s)

within Computer Science Remove this filter Discrete Mathematics in Computer Science Remove this filter Numeric Computing Remove this filter Programming Techniques Remove this filter Andrew V. Goldberg Remove this filter Conference Paper Remove this filter

and

  1. 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)

  2. 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)

  3. 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)