Volume 9
n° 1 (2007), pp. 7-22| author: | Guy Kortsarz |
|---|---|
| title: | A lower bound for approximating grundy numbering |
| keywords: | first-fit coloring hardness approximation |
| 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 |
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Guy Kortsarz (2007), A lower bound for approximating grundy numbering, Discrete Mathematics and Theoretical Computer Science 9, pp. 7-22 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm090102.ps.gz (106 K) |
| ps-source: | dm090102.ps (255 K) |
| pdf-source: | dm090102.pdf (262 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Sun Jan 14 23:10:32 CET 2007 by falk