A lower bound for approximating the Grundy number
Guy Kortsarz · Discrete Mathematics & Theoretical Computer Science · 2007
Graphs and Algorithms 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