A lower bound for approximating the Grundy numberArticle
Authors: Guy Kortsarz 1
NULL
Guy Kortsarz
1 Department of Computer Science [Camden]
The grundy numbering of a graph is the maximum number of colors used by on-line first-fit coloring, under the worst order of arrival of vertices. The grundy numbering problem is to find this ordering. We prove that there is a constant c>1 so that approximating the grundy numbering problem within c is not possible, unless NP ⊆ RP