A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem.

Yves F. Verhoeven A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. 58-68 2006 359 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2006.01.047 db/journals/tcs/tcs359.html#Verhoeven06