Approximation Algorithms and Semidefinite Programming

• Main Authors: Gärtner, Bernd (Author), Matousek, Jiri (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
• Subjects: Mathematics.; Computers.; Algorithms.; Computer science > Mathematics.; Applied mathematics.; Engineering mathematics.; Mathematical optimization.; Applications of Mathematics.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Optimization.

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...