A convex quadratic characterization of the lovász theta number

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 2, 2005, Pages 382-387

  Luz, Carlos J ^a   Schrijver, Alexander ^b  

^a INSTITUTO POLITÉCNICO DE SETÚBAL   (Portugal)

^b CWI   (Netherlands)

Author keywords

Combinatorial optimization; Graph theory; Maximum stable set; Quadratic programming.

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS; QUADRATIC PROGRAMMING;

COMBINATORIAL OPTIMIZATION; LOVASZ V(G) NUMBER; MAXIMUM STABLE SET;

NUMBER THEORY;

EID: 33646848903     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480104429181     Document Type: Article

References (16)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Los Alamitos, CA, 1992, pp. 14-23.
2. C. BERGE, Graphs, North-Holland, Amsterdam, 1991.
3. I. M. BOMZE, M. BUDINICH, P. M. PARDALOS, AND M. PELILLO, The maximum clique problem, in Handbook of Combinatorial Optimization, Vol. A, D. Z. Du and P. M. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999, pp. 1-74.
4. D. M. CARDOSO, Convex quadratic programming approach to the maximum matching problem, J. Global Optim., 19 (2001), pp. 291-306.
5. D. CVETKOVIC, M. DOOB, AND H. SACHS, Spectra of Graphs, Theory, and Applications, VEB Deutscher Verlag der Wissenschaften, Berlin, 1979.
6. L. E. GIBBONS, D. W. HEARN, P. M. PARDALOS, AND M. V. RAMANA, Continuous characterizations of the maximum clique problem, Math. Oper. Res., 22 (1997), pp. 754-768.
7. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
8. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Relaxations of vertex packing, J. Combin. Theory Ser. B, 40 (1986), pp. 330-343.
9. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
10. C. HELMBERG, Semidefinite Programming for Combinatorial Optimization, Konrad-ZuseZentrum für Informationstechnik, Berlin, 2000.
11. D. E. KNUTH, The sandwich theorem, Electron. J. Combin., 1 (1994).
12. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
13. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
14. C. J. LUZ, An upper bound on the independence number of a graph computable in polynomial time, Oper. Res. Lett., 18 (1995), pp. 139-145.
15. C. J. LUZ AND D. M. CARDOSO, A generalization of the Hoffman-Lovdsz upper bound on the independence number of a regular graph, Ann. Oper. Res., 81 (1998), pp. 307-319.
16. T. S. MOTZKIN AND E. G. STRAUS, Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math., 17 (1965), pp. 533-540.