Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization

SIAM Journal on Optimization

Volumn 19, Issue 2, 2008, Pages 592-615

  Gvozdenović, Nebojša ^a   Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

Chromatic number; Hamming graph; Kneser graph; Lov sz theta number; Semidefinite programming; Terwilliger algebra

Indexed keywords

CHROMATIC NUMBER; HAMMING GRAPH; KNESER GRAPH; SEMIDEFINITE PROGRAMMING; TERWILLIGER ALGEBRA;

ALGEBRA; CONTROL THEORY; MEATS;

GRAPH THEORY;

EID: 58149088531     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/070683520     Document Type: Article

References (38)

1. [l] M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 184-193.
2. S. BURER, R. MONTEIRO, AND Y. ZHANG, Maximum stable set formulations and heuristics based on continuous optimization, Math. Program. Ser. A, 94 (2002), pp. 137-166.
3. M. CARAMIA AND P. DELL'OLMO, Bounding vertex coloring by truncated multistage branch and bound, Networks, 44 (2004), pp. 231-242.
4. M. CARAMIA AND P. DELL'OLMO, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Discrete Appl. Math., 156 (2008), pp. 201-217.
5. M. CHIARANDINI, Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems, Ph.D. thesis, Darmstadt University of Technology, 2005.
6. V. CHVÁTAL, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math., 4 (1973, pp. 305-337.
7. P. DELSARTE, An Algebraic Approach to the Association Schemes of Coding Theory, Philips Research Reports Supplements (1973) 10, Philips Research Laboratories, Eindhoven, 1973.
8. C. DESROSIERS, P. GALINIER, AND A. HERTZ, Efficient algorithms for finding critical subgraphs, Discrete Appl. Math., 156 (2008), pp. 244-266.
9. I. DUKANOVIC AND F. RENDL, Semidefinite programming relaxations for graph coloring and maximal clique problems, Math. Program., 109 (2007), pp. 345-365.
10. I. DUKANOVIC AND F. RENDL, A semidefinite programming based heuristic for graph coloring, Discrete Appl. Math., 156 (2008), pp. 180-189.
11. I. DUKANOVIC AND F. RENDL, Coposüiυe Programming Motivated Bounds on the Clique and the Chromatic Number, http://www.optimization-online.org/DB-HTML/2006/05/1403. html (2006).
12. P. GALINIER AND J.-K. HAO, Hybrid evolutionary algorithms for graph coloring, J. Comb. Optim., 3 (1999), pp. 379-397.
13. P. GALINIER, A. HERTZ, AND N. ZUFFEREY, An adaptive memory algorithm for the k-colouring problem, Discrete Appl. Math., 156 (2008), pp. 267-279.
14. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
15. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCRIJVER Geometric Alghorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
16. N. GVOZDENOVIC, Approximating the Stability Number and the Chromatic Number of a Graph via Semidefinite Programming, Ph.D. thesis, University of Amsterdam, 2008.
17. N. GVOZDENOVIC AND M. LAURENT, The operator ψ for the chromatic number of a graph, SIAM J. Optim., 19 (2008), pp. 572-591
18. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), pp. 246-265.
19. J. B. LASSERRE, An explicit exact SDP relaxation for nonlinear 0-1 programs, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2081, K. Aardal and A. M. H. Gerards, eds., Springer-Verlag, Berlin, 2001, pp. 293-303.
20. M. LAURENT, A comparison of the Sherali-Adams, Loυάsz-Schrijver and Lasserre relaxations for 0 - 1 programming, Math. Oper. Res., 28 (2003), pp. 470-496.
21. M. LAURENT, Strengthened semidefinite programming bounds for codes, Math. Program., 109 (2007), pp. 239-261.
22. M. LAURENT AND F. RENDL, Semidefinite programming and integer programming, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Elsevier B.V., New York, 2005, pp 393-514.
23. L. LOVÁSZ, Kneser's conjecture, chromatic numbers and homotopy, J. Combin. Theory Ser. A, 25 (1978), pp. 319-324.
24. L. LOVÁSZ, On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, 25 (1979, pp. 1-7.
25. J. MATOUSEK AND G. ZIEGLER, Topological lower bounds for the chromatic number: A hierarchy, Jahresber. Deutsch. Math.-Verein., 106 (2004), pp. 71-90.
26. I. M. MÉNDEZ-DIAZ AND P. ZABALA, A branch-and-cut algorithm for graph coloring, Discrete Appl. Math., 154 (2006), pp. 826-847.
27. I. MÉNDEZ-DIAZ AND P. ZABALA, A cutting plane algorithm for graph coloring, Discrete Appl. Math., 156 (2008), pp. 159-179.
28. P. MEURDESOIF, Strengthening the Loυász θ (G) bound for graph coloring, Math. Program., 102 (2005), pp. 577-588.
29. J. POVH, F. RENDL, AND A. WlEGELE, A boundary point method to solve semidefinite programs, Computing, 78 (2006), pp. 277-286
30. A. SCHRIJVER, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, Berlin, 2003.
31. A. SCHRIJVER, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 2859-2866.
32. M. SZEGEDY, A note on the theta number of Lovάsz and the generalized Delsarte bound, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 36-39.
33. G. ZIEGLER, Coloring Hamming graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions, in Computational Discrete Mathematics, Lecture Notes in Comput. Sci. 2122, Springer-Verlag, Berlin, 2001, pp. 159-171.
34. http://mat.gsia.cmu.edu/COLOR03/.
35. http://infohost.nmt.edu/̃borchers/csdp.html.
36. http://www-unix.mcs.anl.gov/̃benson/dsdp/.
37. http://dollar.biz.uiowa.edu/̃burer/software/Max-AO/index.html.
38. http://www.math.uni-klu.ac.at/or/Software/theta-bp.m.