Approximation Algorithms and Semidefinite Programming

• Κύριοι συγγραφείς: Gärtner, Bernd (Συγγραφέας), Matousek, Jiri (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
• Θέματα: 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...