Old Web
English
Sign In
Acemap
>
Paper
>
Semidefinite programming approximations for stable sets, colouring, and cuts in graphs
Semidefinite programming approximations for stable sets, colouring, and cuts in graphs
2009
Monique Laurent
J. Lammerink
J-P. Katoen
Joost N. Kok
Pol van de J. C
Raamsdonk van F
Keywords:
Independent set
Combinatorial optimization
Discrete mathematics
Combinatorics
Quadratically constrained quadratic program
Semidefinite programming
Mathematical optimization
Explained sum of squares
Large margin nearest neighbor
Semidefinite embedding
Graph
Mathematics
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]