By Topic

Some tools for approximate 3-coloring

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Blum, A. ; Lab. for Comput. Sci., MIT, Cambridge, MA, USA

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

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990