Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Yossi Azar, Oded Regev. Strongly Polynomial Algorithms for the Unsplittable Flow Problem. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 15-29, Springer, 2001. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: