Guy Kortsarz - A lower bound for approximating the Grundy number

dmtcs:391 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1 - https://doi.org/10.46298/dmtcs.391
A lower bound for approximating the Grundy number

Authors: Guy Kortsarz 1

  • 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

https://doi.org/10.46298/dmtcs.391
Source: HAL:hal-00966515v1
Volume: Vol. 9 no. 1
Section: Graph and Algorithms
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1137/s0895480192224737
  • 10.1137/s0895480192224737
On-Line Coloring and Recursive Graph Theory

2 Documents citing this article

Share and export

Consultation statistics

This page has been seen 205 times.
This article's PDF has been downloaded 239 times.