Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size

** ****Monday, ****February 15, 2010
4:00pm **

5130 Upson Hall

**Abstract**: Linial, London and Rabinovich and Aumann and Rabani proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are $k$ commodities) is $O(\log k)$. This ratio is independent of the size of the graph, and only depends on the number of commodities. Here we attempt to derive a more general theory of Steiner cut and flow problems, and we prove bounds that are poly-logarithmic in $k$ for a much broader class of multicommodity flow and cut problems. Our structural results are motivated by the meta question: Suppose we are given a $poly(\log n)$ approximation algorithm, integrality gap or competitive ratio for a flow or cut problem - when can we give a $poly(\log k)$ guarantee for a generalization of this problem to a Steiner cut or flow problem?

Thus we require that these guarantees be independent of the size of the graph, and only depend on the number of commodities (or the number of terminal nodes in a Steiner cut problem). For many natural applications (when $k = n^{o(1)}$) this yields much stronger guarantees.

We construct vertex-sparsifiers that approximately preserve the value of all terminal multicommodity flows. We prove such sparsifiers exist through zero-sum games and metric geometry, and we construct such sparsifiers through oblivious routing guarantees. These results let us reduce a broad class of multicommodity-type problems to a uniform case (on $k$ nodes) at the cost of a loss of a $poly(\log k)$ in the approximation guarantee. We then give $poly(\log k)$ approximation algorithms for a number of problems for which such results were previously unknown, such as requirement cut, l-multicut, oblivious $0$-extension, and natural generalizations of oblivious routing, min-cut linear arrangement and minimum linear arrangement.