Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts

Tardos, E.Klein, P.Plotkin, S.Stein, C.2007-11-092007-11-091991-02961https://hdl.handle.net/1813/8846This paper to appear in "IIE Transactions".4013866 bytesapplication/pdfen-USOperations ResearchIndustrial Engineeringtechnical reportFaster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cutstechnical report