Approximation Algorithms and Semidefinite Programming

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
Call Number:Libro Electrónico
Main Authors: Gärtner, Bernd (Author), Matousek, Jiri (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edition:1st ed. 2012.
Subjects:
Mathematics.
Computer science.
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Mathematical optimization.
Applications of Mathematics.
Theory of Computation.
Discrete Mathematics in Computer Science.
Optimization.
Online Access:Texto Completo

Internet

Texto Completo

Items no disponibles

Holdings details from

Similar Items