A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows

1995
*
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
*

Minimum cost multicommodity o w is an instance of a simpler problem (multicommodity o w) to which a cost constraint h as been added. In this paper we present a general scheme for solving a large class of such \cost-added" problems|even if more than one cost is added. One o f t h e m ain applications of this method is a new deterministic algorithm for approximately solving t h e minimumcost multicommodity o w problem. Our algorithm nds a (1 + ) a p proximation to t h e minimum cost ow i ñ O ( 3

doi:10.1145/225058.225073
dblp:conf/stoc/KargerP95
fatcat:oqsreooi3jc6jjo3yq54vjlplm