Approximate graph coloring by semidefinite programming

We consider the problem of coloring k-colorable graphs with the fewest possible colors. We give a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with min {O(/spl Delta//sup 1/3/log/sup 4/3//spl Delta/), O(n/sup 1/4/ log n)} colors where /spl Delta/ is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the first non-trivial approximation result as a function of the maximum degree /spl Delta/. This result can be generalized to k-colorable graphs to obtain a coloring using min {O/spl tilde/(/spl Delta//sup 1-2/k/), O/spl tilde/(n/sup 1-3/(k+1/))} colors. Our results are inspired by the recent work of Goemans and Williamson who used an algorithm for semidefinite optimization problems, which generalize linear programs, to obtain improved approximations for the MAX CUT and MAX 2-SAT problems. An intriguing outcome of our work is a duality relationship established between the value of the optimum solution to our semidefinite program and the Lovasz /spl thetav/-function. We show lower bounds on the gap between the optimum solution of our semidefinite program and the actual chromatic number; by duality this also demonstrates interesting new facts about the /spl thetav/-function.<<ETX>>

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  E. C. Milner.  A Combinatorial Theorem on Systems of Sets , 1968 .

[3]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[4]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[5]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[8]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[9]  John Cocke,et al.  A methodology for the real world , 1981 .

[10]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[11]  Gregory J. Chaitin,et al.  Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.

[12]  Gene H. Golub,et al.  Matrix computations , 1983 .

[13]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[14]  D. Aldous.  Probability Approximations via the Poisson Clumping Heuristic , 1988 .

[15]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[16]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..

[18]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

[19]  Mario Szegedy.  A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[20]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[21]  Avrim Blum,et al.  New approximation algorithms for graph coloring , 1994, JACM.

[22]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[23]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[24]  R. Motwani,et al.  On Exact and Approximate Cut Covers of Graphs , 1994 .

[25]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[26]  Noga Alon,et al.  A spectral technique for coloring random 3-colorable graphs (preliminary version) , 1994, STOC '94.

[27]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[28]  Uriel Feige,et al.  Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.

[29]  Ramesh Hariharan,et al.  Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[30]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..