Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Online Computation and Competitive Analysis;Borodin,1998
2. Bounding the power of preemption in randomized scheduling;Canetti;SIAM Journal on Computing,1998
3. On the k-coloring of intervals;Carlisle;Discrete Applied Mathematics,1995
4. Leah Epstein, Asaf Levin, Improved randomized results for that interval selection problem, in: Proc. of the 16th Annual European Symposium on Algorithms, ESA2008, 2008, pp. 381–392.
5. Note on scheduling intervals on-line;Faigle;Discrete Applied Mathematics,1995
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献