Approximation algorithms and semidefinite programming [electronic resource] / Bernd Gärtner, Jiří Matoušek.

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit...

Full description

Bibliographic Details

Online Access:	Full Text (via Springer)
Main Author:	Gärtner, Bernd
Other Authors:	Matoušek, Jiří, 1963-
Format:	Electronic eBook
Language:	English
Published:	Heidelberg ; New York : Springer-Verlag Berlin Heidelberg, ©2012.
Subjects:	Approximation algorithms. Semidefinite programming.