In which we define a multi-commodity flow problem, and we see that its dual is the relaxation of a useful graph partitioning problem. The relaxation can be rounded to yield an approximate graph partitioning algorithm. An advantage of writing the maximum flow problem as a linear program, as we did in the past lecture, is that we can consider variations of… (More)

Sorry, we couldn't extract any figures or tables for this paper.