Author:
Fung Stanley P. Y.,Poon Chung Keung,Zheng Feifeng
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference18 articles.
1. Awerbuch B, Bartal Y, Fiat A, Rosen A (1994) Competitive non-preemptive call control. In: Proceedings of 5th ACM-SIAM symposium on discrete algorithms, pp 312–320
2. Baruah S, Koren G, Mao D, Mishra B, Raghunathan A, Rosier L, Shasha D, Wang F (1992) On the competitiveness of on-line real-time task scheduling. Real-Time Syst 4:125–144
3. Bogart KP, West DB (1999) A short proof that proper = unit. Discrete Math 201:21–23
4. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, New York
5. Canetti R, Irani S (1998) Bounding the power of preemption in randomized scheduling. SIAM J Comput 27(4):993–1015
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献