Approximating the stability number and the chromatic number of a graph via semidefinite programming

Additional Metadata
Keywords	Semidefinite programming, Stable set, Graph colouring
THEME	Logistics (theme 3)
Promotor	A. Schrijver (Lex)
Degree Grantor	Universiteit van Amsterdam
ISBN	978-90-6196-546-6
Persistent URL	hdl.handle.net/11245/1.279637
Project	Semidefinite programming and combinatorial optimization
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Gvozdenovic, N. (2008, April 10). Approximating the stability number and the chromatic number of a graph via semidefinite programming. Retrieved from http://hdl.handle.net/11245/1.279637

Publication