Greedy distributed optimization of multi-commodity flows
Baruch Awerbuch, Rohit Khandekar · 2007
The multi-commodity flow problem is a classical combinatorial optimization problem that addresses a number of practically important issues of congestion and bandwidth management in connection-oriented network architectures.