The operator ψ for the chromatic number of a graph

SIAM Journal on Optimization

Volumn 19, Issue 2, 2008, Pages 572-591

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

^a CWI   (Netherlands)

Author keywords

(Fractional) chromatic number; Lov sz theta number; Semidefinite programming; Stability number

Indexed keywords

(FRACTIONAL) CHROMATIC NUMBER; CHROMATIC NUMBER; COPOSITIVE; GRAPH PARAMETERS; HAMMING GRAPHS; KNESER GRAPH; LOWER BOUNDS; NON-NEGATIVITY; POLYNOMIAL-TIME; SEMIDEFINITE PROGRAMMING; STABILITY NUMBER; TRIANGLE INEQUALITY;

CONTROL THEORY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 58149103431     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050648237     Document Type: Article

References (39)

1. 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. I. M. BOMZE, M. DÜR, E. DE KLERK, A. QUIST, C. ROOS, AND T. TERLAKY, On copositive programming and standard quadratic optimization problems, J. Global Optim., 18 (2000), pp. 301-320.
3. J. A. BONDY AND P. HELL, A note on the star chromatic number, J. Graph Theory, 14 (1990), pp. 479-482.
4. V. CHVÁTAL, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math., 4 (1973), pp. 305-337.
5. E. DE KLERK, D. V. PASECHNIK, AND J. P. WARNERS, On approximate graph colouring and MAX-k-CUT algorithms based on the ϋ-function, J. Comb. Optim., 8 (2004), pp. 267-294.
6. E. DE KLERK AND D. V. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
7. I. M. DIAZ AND P. ZABALA, A branch-and-cut algorithm for graph coloring, Discrete Appl. Math., 154 (2006), pp. 826-847.
8. I. DUKANOVIC AND F. RENDL, A semidefinite programming-based heuristic for graph coloring, Discrete Appl. Math., 156 (2008), pp. 180-189.
9. I. DUKANOVIC AND F. RENDL, Copositive programming motivated bounds on the clique and the chromatic number, Optimization Online (2006), available online from http://www.optimization- online.org/DB-HTML/2006/05/1403.html.
10. P. ERDÖS, Z. FÜREDI, A. HAJNAL, P. KOMJÁTH, V. RÖDL, AND Á. SERESS, Coloring graphs with locally few colors, Discrete Math., 59 (1986), pp. 21-34.
11. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. N. GVOZDENOVIC, Approximating the Stabiliy Number and the Chromatic Number of Graph Via Semidefinite Programming, Ph.D. thesis, in preparation.
13. N. GVOZDENOVIC AND M. LAURENT, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Math. Program., 110 (2007), pp. 145-173 (extended abstract in Lecture Notes in Comput. Sci. 3509, M. Jünger and V. Kaibel, eds., Springer, Berlin, pp. 136-151).
14. N. GVOZDENOVIC AND M. LAURENT, Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization, SIAM J. Optim., 19 (2008), pp. 592-615.
15. G. HAHN, P. HELL, AND S. POLJAK, On the ultimate independence ratio of a graph, European J. Combin., 16 (1995), pp. 253-261.
16. P. HELL, X. YU, AND H. ZHOU, Independence ratios of graph powers, Discrete Math., 127 (1994), pp. 213-220.
17. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), pp. 246-265.
18. J. KÖRNER, C. PlLOTTO, AND G. SIMONYI, Local chromatic number and Sperner capacity, J. Combin. Theory Ser. B, 95 (2005), pp. 101-117.
19. J. B. LASSERRE, An explicit exact SDP relaxation for nonlinear 0-1 programs, Lecture Notes in Comput. Sci. 2081, K. Aardal and A.M.H. Gerards, eds., 2001, Springer, Berlin, pp. 293- 303.
20. M. LAURENT, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for0-l 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, Semidefinüe programming and integer programming, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Elsevier B. V., Amsterdam, 2005, pp. 393-514.
23. L. LovÁsz, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
24. L. LovÁsz AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
25. Y. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), pp. 960-981.
26. R. J. MCELIECE, E. R. RODEMICH, AND H. C. RUMSEY, The Lovász' bound and some generalizations, J. Combin. Inform. System Sci.,3 (1978), pp. 134-152.
27. P. MEURDESOIF, Strengthening the Lovász Θ(G) bound for graph coloring, Math. Program., 102 (2005), pp. 577-588.
28. T. S. MOTZKIN AND E. G. STRAUS, Maxima for graphs and a new proof of a theorem of Túran, Canad. J. Math., 17 (1965), pp. 533-540.
29. P. PARRILO, Structured Semidefinüe Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, 2000.
30. J. PEÑA, J. VERA, AND L. ZULUAGA, Computing the stability number of a graph via linear and semidefinüe programming, SIAM J. Optim., 18 (2007), pp. 87-105.
31. S. POLJAK, A note on stable sets and colorings of graphs, Comment. Math. Univ. Carolin., 15 (1974), pp. 307-309.
32. A. SCHRIJVER, A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory, 25 (1979), pp. 425-429.
33. A. SCHRIJVER, Combinatorial Optimization - Polyhedra and Efficiency, Springer, Berlin, 2003.
34. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
35. G. SlMONYl, Asymptotic values of the Hall-ratio for graph powers, Discrete Math., 306 (2006), pp. 2593-2601.
36. M. SZEGEDY, A note on the theta number of Lovάsz and the generalized Delsarte bound, in Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994, pp. 36-39.
37. A. VINCE, Star chromatic number, J. Graph Theory, 12 (1988), pp. 551-559.
38. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBERGHE, Handbook of Semidefinüe Programming, Kluwer Academic, Boston, 2000.
39. X. ZHU, Circular chromatic number: A survey, Discrete Math., 229 (2001), pp. 371-410.