A lower bound for approximating grundy numbering

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 proble...

Full description

Bibliographic Details
Main Author:	Guy Kortsarz
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Online Access:	http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/625

id	doaj-3ddb441ab5a9416b99266e9e463cb0b1
record_format	Article
spelling	doaj-3ddb441ab5a9416b99266e9e463cb0b12020-11-24T22:36:26ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1462-72641365-80502007-01-0191A lower bound for approximating grundy numberingGuy KortsarzThe 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 http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/625
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Guy Kortsarz
spellingShingle	Guy Kortsarz A lower bound for approximating grundy numbering Discrete Mathematics & Theoretical Computer Science
author_facet	Guy Kortsarz
author_sort	Guy Kortsarz
title	A lower bound for approximating grundy numbering
title_short	A lower bound for approximating grundy numbering
title_full	A lower bound for approximating grundy numbering
title_fullStr	A lower bound for approximating grundy numbering
title_full_unstemmed	A lower bound for approximating grundy numbering
title_sort	lower bound for approximating grundy numbering
publisher	Discrete Mathematics & Theoretical Computer Science
series	Discrete Mathematics & Theoretical Computer Science
issn	1462-7264 1365-8050
publishDate	2007-01-01
description	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
url	http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/625
work_keys_str_mv	AT guykortsarz alowerboundforapproximatinggrundynumbering AT guykortsarz lowerboundforapproximatinggrundynumbering
_version_	1725720320941228032

A lower bound for approximating grundy numbering

Similar Items