Author:
Azar Yossi,Epstein Amir,Epstein Leah
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing 29, 459–473 (1999)
2. Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1(1), 55–66 (1998)
3. Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the
${\it l_p}$
norm. Algorithmica 29, 422–441 (2001); Also in Proc. 9th ACM-SIAMSODA, pp. 426–435 (1998)
4. Azar, Y., Epstein, L.: On-line load balancing of temporary tasks on identical machines. In: 5th Israeli Symp. on Theory of Computing and Systems, pp. 119–125 (1997)
5. Azar, Y., Regev, O., Sgall, J., Woeginger, G.: Off-line temporary tasks assignment. Theoretical Computer Science 287, 419–428 (2002)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献