Publisher
Kluwer Academic Publishers
Reference22 articles.
1. A. Baltz and A. Srivastav, Fast Approximation of Minimum Multicast Congestion-Implementation versus Theory, Proceedings of 5th Conference on Algorithms and Complexity, CIAC 2003.
2. M. Charikar, C. Chekuri, A. Goel, S. Guha and S. Plotkin, Approximating a finite metric by a small number of tree metrics, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, 379–388.
3. G. Even, J. S. Naor, S. Rao and B. Schieber, Fast approximate graph partitioning algorithms, SIAM. Journal on Computing, 6 (1999), 2187–2214.
4. N. Garg and J. Könemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, 300–309.
5. M. D. Grigoriadis and L. G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4 (1994), 86–107.