Improved Approximation Algorithms for Unsplittable Flow Problems with Stavros Kolliopoulos. To appear in SIAM J. Computing. Initial version appeared in Proceedings of FOCS 97. A description of a recent implementation of a combinatorial minimum cost multicommodity flow algorithm, done jointly with Andrew Goldberg, Jeffrey Oldham and Serge Plotkin can be found here Implementation of a Combinatorial Multicommodity Flow Algorithm, with Tishya Leong and Peter Shor. Preliminary version appeared in STOC '91 Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts with Philip Klein, Serge Plotkin and Eva Tardos.
Comments are welcome.
A New Approach to the Minimum Cut Problem with David Karger. Preliminary Version appeared in STOC 93. A New Approach to Clusting with Javed Asalam and Alain Leblanc. In Proceedings of WAE 00. Better Rounding Algorithms for a Geometric Embedding Relaxation of Minimum Multiway Cut with D. Karger, P. Klein, M. Thorup, and N. Young.