This class of problems includes the maximum generalized assignment problem (GAP) 1 and a distributed caching problem (DCP) described in this paper. Given a β-approximation algorithm for finding the ...

With Kin's algorithm, all important network flow problems, including maximum flow and minimum cost problems, can now be treated as special cases of the minimum cost flow problem.