Author:
Epstein Leah,Erlebach Thomas,Levin Asaf
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference27 articles.
1. Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Proceedings of the First International Workshop on Approximation and Online Algorithms (WAOA’03). Lecture Notes in Computer Science, vol. 2909, pp. 1–12 (2003)
2. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486–504 (1997)
3. Azar, Y., Fiat, A., Levy, M., Narayanaswamy, N.: An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. 363(1), 18–27 (2006)
4. Baruah, S.K., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L.E., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Syst. 4(2), 125–144 (1992)
5. Chrobak, M., Ślusarek, M.: On some packing problems relating to dynamical storage allocation. RAIRO J. Inf. Theory Appl. 22, 487–499 (1988)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Station Assignment with Reallocation;Algorithmica;2018-05-30
2. A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016