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 - Francis Birch - 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

	Spectral Graph Theory and Applications WSProblem Set 1 Due: Nov. 25 DocID: 1rsKM - View Document
	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 DocID: 1rs14 - View Document
	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 DocID: 1pWWK - View Document
	Symposium on Theoretical Aspects of Computer ScienceNancy, France), ppwww.stacs-conf.org arXiv:1001.3251v2 [cs.CC] 3 FebTHE RECOGNITION OF TOLERANCE DocID: 1pwXn - View Document
	Spectral Graph Theory and Applications WSLecture 8: Construction of Expanders Lecturer: Thomas Sauerwald & He Sun DocID: 1p80I - View Document