Publisher
Springer Berlin Heidelberg
Reference83 articles.
1. S. Albers. Better bounds for on-line scheduling. In Proc. of the 29th Ann. ACM Symp. on Theory of Computing, 130–139. ACM, 1997.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. J. ACM, 44(3):486–504, 1997.
3. A. Avidor, Y. Azar, and J. Sgall. Ancient and new algorithms for load balancing in the L p norm. In Proc. of the 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 426–435. ACM-SIAM, 1998.
4. B. Awerbuch, Y. Azar, E. F. Grove, M.-Y. Kao, P. Krishnan, and J. S. Vitter. Load balancing in the l p norm. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Sci., 383–391. IEEE, 1995.
5. Y. Azar. On-line load balancing. Chapter 8 in On-Line Algorithms: The State of the Art, eds. A. Fiat and G. Woeginger, Lecture Notes in Comput. Sci. Springer-Verlag, 178–195, 1998.
Cited by
176 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献