Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules (1996)
Leighton Bruce Maggs, F. T. Leighton
In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to...