Skip to main content

Minimum Cost Flows in Graphs with Unit Capacities

Author(s): Goldberg, Andrew V; Kaplan, Haim; Hed, Sagi; Tarjan, Robert E

To refer to this page use:
Abstract: We consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have been developed. In contrast, for maximum flow with unit capacities, the best bounds are proven for slight modifications of classical blocking flow and push-relabel algorithms. In this paper we show that the classical cost scaling algorithms of Goldberg and Tarjan (for general integer capacities) applied to a problem with unit capacities achieve or improve the best known bounds. For weighted bipartite matching we establish a bound of O( √ rm log C) on a slight variation of this algorithm. Here r is the size of the smaller side of the bipartite graph, m is the number of edges, and C is the largest absolute value of an arc-cost. This simplifies a result of [Duan et al. 2011] and improves the bound, answering an open question of [Tarjan and Ramshaw 2012]. For graphs with unit vertex capacities we establish a novel O( √ nm log(nC)) bound. We also give the first cycle canceling algorithm for minimum cost flow with unit capacities. The algorithm naturally generalizes the single source shortest path algorithm of [Goldberg 1995].
Publication Date: 2015
Citation: Goldberg, Andrew V., Haim Kaplan, Sagi Hed, and Robert E. Tarjan. "Minimum Cost Flows in Graphs with Unit Capacities." In 32nd International Symposium on Theoretical Aspects of Computer Science 30 (2015): pp. 406-419. doi:10.4230/LIPIcs.STACS.2015.406
DOI: 10.4230/LIPIcs.STACS.2015.406
ISSN: 1868-8969
Pages: 406 - 419
Type of Material: Conference Article
Journal/Proceeding Title: 32nd International Symposium on Theoretical Aspects of Computer Science
Version: Final published version. This is an open access article.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.