Cart (Loading....) | Create Account
Close category search window
 

Improved hardness results for approximating the chromatic number

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)
Furer, M. ; Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA

First, a simplified geometric proof is presented for the result of C. Lund and M. Yannakakis (1994) saying that for some ε>0 it is NP-hard to approximate the chromatic number of graphs with N vertices by a factor of Nε. Then, more sophisticated techniques are employed to improve the exponent. A randomized twisting method allows us to completely pack a certain space with copies of a graph without much affecting the independence number. Together with the newest results of M. Bellare et al. (1995), on the number of amortized free bits, it is shown that for every ε>0 the chromatic number cannot be approximated by a factor of N1/5-ε unless NP=ZPP. Finally, we get polynomial lower bounds in terms of χ. Unless NP=ZPP, the performance ratio of every polynomial time algorithm approximating the chromatic number of χ-colorable graphs (i.e., the chromatic number is at most χ) is at least χ1/5-o(1) (where the o-notation is with respect to χ)

Published in:

Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on

Date of Conference:

23-25 Oct 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.