A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing

Thomas Rothvoß. A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing. In Michel X. Goemans, José R. Correa, editors, Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings. Volume 7801 of Lecture Notes in Computer Science, pages 336-348, Springer, 2013. [doi]

Authors

Thomas Rothvoß

This author has not been identified. Look up 'Thomas Rothvoß' in Google