A lower bound for approximating the Grundy number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2007

A lower bound for approximating the Grundy number

Abstract

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
Fichier principal
Vignette du fichier
dm090102.pdf (189.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00966515 , version 1 (26-03-2014)

Identifiers

Cite

Guy Kortsarz. A lower bound for approximating the Grundy number. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 1 (1), pp.7--21. ⟨10.46298/dmtcs.391⟩. ⟨hal-00966515⟩

Collections

TDS-MACS
40 View
699 Download

Altmetric

Share

Gmail Facebook X LinkedIn More