S. Plotkin and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. S. Plotkin, D. Shmoys, and E. Tardos. Math of Oper. Preliminary version in FOCS 1991.
Fast approximation algorithms for multicommodity flow problem.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. JCSS version, Preliminary vers. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Using Separation Algorithms in Fixed Dimension.