Cargando…

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Gärtner, Bernd (Autor), Matousek, Jiri (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Temas:
Acceso en línea:Texto Completo