Journal of the ACM Bibliography

Selected papers that cite this one

• James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486-504, May 1997.

• Yonatan Aumann and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, February 1998.

• Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive on-line routing. In 34th Annual Symposium on Foundations of Computer Science, pages 32-40, Palo Alto, California, 3-5 November 1993. IEEE.

• Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Fast approximate graph partitioning algorithms. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 639-648, New Orleans, Louisiana, 5-7 January 1997.

• Anil Kamath, Omri Palmon, and Serge Plotkin. Routing and admission control in general topology networks with Poisson arrivals. Journal of Algorithms, 27(2):236-258, May 1998.

• Philip Klein and Hsueh-I Lu. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 338-347, Philadelphia, Pennsylvania, 22-24 May 1996.

• Philip Klein, Serge Plotkin, Clifford Stein, and Éva Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, June 1994.

• Tom Leighton, Fillia Makedon, Serge Plotkin, Clifford Stein, Éva Tardos, and Spyros Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228-243, April 1995.

Shortcuts: