Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

Voted

MP
2007

73views more MP 2007»

Semidefinite programming relaxations for graph coloring and maximal clique problems

15 years 2 months ago

Semidefinite programming relaxations for graph coloring and maximal clique problems

Download www.core.ucl.ac.be

Igor Dukanovic, Franz Rendl

Real-time Traffic

MP 2007 |

claim paper

Related Content

» Explicit Sensor Network Localization using Semidefinite Representations and Facial Reducti...

» Code design for radar STAP via optimization theory

» Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constrai...

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MP
Authors	Igor Dukanovic, Franz Rendl

Comments (0)