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

Ankur Moitra. Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. pages 3-12, IEEE Computer Society, 2009. [doi]

Abstract

Abstract is missing.