DocumentCode :
2783980
Title :
Some tools for approximate 3-coloring
Author :
Blum, Avrim
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fYear :
1990
fDate :
22-24 Oct 1990
Firstpage :
554
Abstract :
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 3/8)+O(n3/8+O(1)) colors (or more precisely) O(n3/8log5/8 n) colors, which improves the previous best bound of O(n0.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 (pn -1/2+ε for constant ε>0), is presented
Keywords :
algorithm theory; graph colouring; 3-chromatic graphs; approximate 3-coloring; approximation algorithms; noise rate; probability; semirandom source; Colored noise; Computer science; Laboratories; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
Type :
conf
DOI :
10.1109/FSCS.1990.89576
Filename :
89576
Link To Document :
بازگشت