2011 Volume 17 Issue 3 Pages 197-216
In these lecture notes, we study problems of designing low-congestion subnetworks of given networks. We apply some newest results in Graph Minor Theory to the problem, and obtain efficient (even best possible) algorithms.