Abstract
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n 0.2072 colors. There are no indications that coloring using say O(logn) colors is hard. It has been suggested that SDP hierarchies could be used to design algorithms that use n ε colors for arbitrarily small ε > 0.
We explore this possibility in this paper and find some cause for optimism. While the case of general graphs is till open, we can analyse the Lasserre relaxation for two interesting families of graphs.
For graphs with low threshold rank (a class of graphs identified in the recent paper of Arora, Barak and Steurer on the unique games problem), Lasserre relaxations can be used to find an independent set of size Ω(n) (i.e., progress towards a coloring with O(logn) colors) in n O(D) time, where D is the threshold rank of the graph. This algorithm is inspired by recent work of Barak, Raghavendra, and Steurer on using Lasserre Hierarchy for unique games. The algorithm can also be used to show that known integrality gap instances for SDP relaxations like strict vector chromatic number cannot survive a few rounds of Lasserre lifting, which also seems reason for optimism.
For distance transitive graphs of diameter Δ, we can show how to color them using O(logn) colors in \(n^{2^{O(\Delta)}}\) time. This family is interesting because the family of graphs of diameter O(1/ε) is easily seen to be complete for coloring with n ε colors. The distance-transitive property implies that the graph “looks” the same in all neighborhoods.
The full version of this paper can be found at: http://www.cs.princeton.edu/~rongge/LasserreColoring.pdf .
Research supported by NSF Grants CCF-0832797, 0830673, and 0528414.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, pp. 563–572. IEEE Computer Society, Washington, DC, USA (2010)
Arora, S., Chlamtac, E., Charikar, M.: New approximation guarantee for chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 215–224. ACM, New York (2006)
Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation (2011)
Biggs, N.L.: Intersection matrices for linear graphs. In: Welsh, D.J.A. (ed.) Combinatorial Mathematics and its Applications, pp. 15–23. Academic Press, London (1971)
Blum, A.: New approximation algorithms for graph coloring. J. ACM 41, 470–516 (1994)
Blum, A., Karger, D.: An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs. Information Processing Letters 61, 49–53 (1996)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance Regular Graphs. Springer, Heidelberg (1989)
Chlamtac, E.: Non-Local Analysis of SDP-Based Approximation Algorithms. PhD thesis, Princeton University (2009)
Chlamtac, E., Tulsiani, M.: Convex relaxations and integrality gaps. Unpublished manuscript
Dinur, I., Mossel, E., Regev, O.: Conditional hardness for approximate coloring. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 344–353. ACM, New York (2006)
Feige, U., Langberg, M., Schechtman, G.: Graphs with tiny vector chromatic numbers and huge chromatic numbers. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 283–292. IEEE Computer Society, Washington, DC, USA (2002)
Frankl, P., Rodl, V.: Forbidden intersections. Transactions of the American Mathematical Society 300(1), 259–286 (1987)
Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM 45, 246–265 (1998)
Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293–303. Springer, Heidelberg (2001)
Laurent, M.: A comparison of the sherali-adams, lovasz-schrijver and lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28, 470–496 (2001)
Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 166–190 (1991)
Sherali, H.D., Adams, W.P.: A hierarchy of relaxation between the continuous and convex hull representations. SIAM J. Discret. Math. 3, 411–430 (1990)
Szegedy, M.: A note on the θ number of lovasz and the generalized delsarte bound. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 36–39. IEEE Computer Society, Washington, DC, USA (1994)
Wigderson, A.: Improving the performance guarantee for approximate graph coloring. J. ACM 30, 729–735 (1983)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 681–690. ACM, New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, S., Ge, R. (2011). New Tools for Graph Coloring. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2011 2011. Lecture Notes in Computer Science, vol 6845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22935-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22935-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22934-3
Online ISBN: 978-3-642-22935-0
eBook Packages: Computer ScienceComputer Science (R0)