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 2012 - Frank Redington - Document - PDFSEARCH.IO

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 2012 Add to Reading List Source URL: www.daviddelaat.nl Download Document from Source Website File Size: 1,08 MB Share Document on Facebook