Skip to content

Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.

Baruch Awerbuch, Tom Leighton

VenueA*STOC
Year1994
ProceedingsSTOC

Browse the full STOC paper archive.