Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
| Hi-index | 0.00 |
Several tools for use in approximation algorithms to color 3-chromatic graphs are presented. The techniques are used in an algorithm that colors any 3-chromatic graph with O(n/sup 3/8/)+O(n/sup 3/8+O(1)/) colors (or more precisely) O(n/sup 3/8/log/sup 5/8/ n) colors, which improves the previous best bound of O(n/sup 0.4+0(1)/) colors. The techniques are illustrated by considering a problem in which the 3-chromatic graph is created not by a worst-case adversary, but by an adversary each of whose decisions (whether or not to include an edge) is reversed with some small probability or noise rate p. This type of adversary is equivalent to the semirandom source of M. Santha and U.V. Vazirani (1986). An algorithm that will actually 3-color such a graph with high probability even for quite low noise rates (por=n/sup -1/2+ epsilon / for constant epsilon 0), is presented.