Author:
Berman Piotr,Charikar Moses,Karpinski Marek
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference14 articles.
1. S. Albers, Better bounds for online scheduling, inProc. 29th ACM Stock (1997), pp. 130–139.
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, inProc. 25th ACM STOC (1993), pp. 623–631; see also On-line routing of virtual circuits with applications to load balancing and machine scheduling, J. Assoc. Comput. Mach.44 (1997), 486–504.
3. Y. Azar, A. Broder, and A. Karlin, On-line load balancing, inProc. 33rd IEEE FOCS (1992), pp. 218–225.
4. Y. Azar, J. Naor, and R. Rom, The competitiveness of on-line assignment, inProc. 3rd ACM-SIAM SODA (1992), pp. 203–210.
5. Yet more on the linear search problem;Beck;Israel J. Math.,1970
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献