First Page | Document Content | |
---|---|---|
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 2013Add to Reading ListSource URL: www.daviddelaat.nlDownload Document from Source WebsiteFile Size: 385,72 KBShare Document on Facebook |