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...
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 |
Ejemplares similares
-
Optimal Interconnection Trees in the Plane Theory, Algorithms and Applications /
por: Brazil, Marcus, et al.
Publicado: (2015) -
The Linear Ordering Problem Exact and Heuristic Methods in Combinatorial Optimization /
por: Martí, Rafael, et al.
Publicado: (2011) -
Exact Exponential Algorithms
por: Fomin, Fedor V., et al.
Publicado: (2010) -
Constrained Optimization and Image Space Analysis Volume 1: Separation of Sets and Optimality Conditions /
por: Giannessi, Franco
Publicado: (2005) -
Facets of Combinatorial Optimization Festschrift for Martin Grötschel /
Publicado: (2013)