Semidefinite Programs and Combinatorial Optimization
Author:
- L. LovászLLL. Lovász
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 137-194
Abstract
No abstract availableKeywords
This publication has 73 references indexed in Scilit:
- A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine ConstraintsDiscrete & Computational Geometry, 2001
- The Colin de Verdi re number and sphere representations of a graphCombinatorica, 1997
- Randomized graph products, chromatic numbers, and the Lov sz ?-functionCombinatorica, 1997
- An algorithm for 3-colorable graphsInformation Processing Letters, 1997
- How to cage an eggInventiones Mathematicae, 1992
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Systems of vectors in Euclidean space and an extremal problem for polynomialsMathematical Notes, 1981
- Subspaces of symmetric matrices containing matrices with a multiple first eigenvaluePacific Journal of Mathematics, 1976
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- On the dimension of a graphMathematika, 1965