First Page | Document Content | |
---|---|---|
Graph theory Mathematics NP-complete problems Information theory Combinatorial optimization NP-hard problems Lovsz number Independent set | A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012Add to Reading ListSource URL: www.daviddelaat.nlDownload Document from Source WebsiteFile Size: 1,08 MBShare Document on Facebook |