Author:
Halldórsson Magnús M.,Shachnai Hadas
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Albers, S.: Better bounds for online scheduling. In: STOC, pp. 130–139 (1997)
2. Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC (2005)
3. Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms 52, 120–133 (2004)
4. Bartal, Y., Karloff, H.J., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett 50(3), 113–116 (1994)
5. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献