<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Discrete geometry / Independent set / FranklRdl graph / Lovsz number
Graph theory
NP-complete problems
Discrete geometry
Independent set
FranklRdl graph
Lovsz number

A semidefinite programming hierarchy for geometric packing problems David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Isaac Newton Institute for Mathematical Sciences – July 2013

Add to Reading List

Source URL: www.daviddelaat.nl

Download Document from Source Website

File Size: 385,72 KB

Share Document on Facebook

Similar Documents