Reference16 articles.
1. Adamy U, Erlebach T (2003) Online coloring of intervals with bandwidth. In: Proceedings of the first international workshop on approximation and online algorithms (WAOA2003), Budapest, Hungary, pp 1–12
2. Azar Y, Fiat A, Levy M, Narayanaswamy NS (2006) An improved algorithm for online coloring of intervals with bandwidth. Theor Comput Sci 363(1):18–27
3. Bar-Noy A, Motwani R, Naor J (1992) The greedy algorithm is optimal for on-line edge coloring. Inf Process Lett 44(5):251–253
4. Chrobak M, Ślusarek M (1988) On some packing problems relating to dynamical storage allocation. RAIRO J Inf Theory Appl 22:487–499
5. Epstein L, Levin A (2012) On the max coloring problem. Theor Comput Sci 462(1):23–38
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献