Author:
Iwama Kazuo,Taketomi Shiro
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J. Csirik, G. Galambos, and G. Turán, “A lower bound on on-line algorithms for decreasing lists,” Proc. EURO VI, 1984.
2. J. Csirik, and G. Woeginger, “Resource argumentation for online bounded space bin packing,” Proc. ICALP 2000, pp. 296–304, 2000.
3. M. M. Halldórsson, “Online coloring known graphs,” Electronic J. Combinatorics, Vol. 7, R7, 2000. http://www.combinatorics.org .
4. M. M. Halldórsson, K. Iwama, S. Miyazaki, and S. Taketomi, “Online independent sets,” Proc. COCOON 2000, pp. 202–209, 2000.
5. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, “Worst-case performance bounds for simple one-dimensional packing algorithms,” SIAM Journal on Computing, Vol. 3(4), pp. 299–325, 1974.
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献