The design of approximation algorithms /
"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Williamson, David P. |
Otros Autores: | Shmoys, David Bernard |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Greedy Approximation.
por: Temlyakov, Vladimir
Publicado: (2011) -
Greedy Approximation.
por: Temlyakov, Vladimir
Publicado: (2011) -
Selected topics in approximation and computation /
por: Kowalski, Marek A., 1953-
Publicado: (1995) -
Shape-preserving approximation by real and complex polynomials /
por: Gal, Sorin G., 1953-
Publicado: (2008) -
Grothendieck spaces in approximation theory.
por: Blatter, Jörg
Publicado: (1972)