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

Descripción completa

Detalles Bibliográficos
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:
Approximation theory.
Mathematical optimization.
Théorie de l'approximation.
Optimisation mathématique.
COMPUTERS > Programming > Algorithms.
MATHEMATICS > Numerical Analysis.
Análisis numérico
Algoritmos
Programación
Approximation theory
Mathematical optimization
Algorithmus
Approximationstheorie
Acceso en línea:Texto completo
Tabla de Contenidos:
  • An introduction to the techniques. An introduction to approximation algorithms
  • Greedy algorithms and local search
  • Rounding data and dynamic programming
  • Deterministic rounding of linear programs
  • Random sampling and randomized rounding of linear programs
  • Randomized rounding of semidefinite programs
  • The primal-dual method
  • Cuts and metrics
  • Further uses of the techniques. Further uses of greedy and local search algorithms
  • Further uses of rounding data and dynamic programming
  • Further uses of deterministic rounding of linear programs
  • Further uses of random sampling and randomized rounding of linear programs
  • Further uses of randomized rounding of semidefinite programs
  • Further uses of the primal-dual method
  • Further uses of cuts and metrics
  • Techniques in proving the hardness of approximation
  • Open problems
  • Appendix A: Linear programming
  • Appendix B: NP-completeness.

Ejemplares similares