Cargando…
Design and Analysis of Approximation Algorithms
When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York, NY :
Springer New York : Imprint: Springer,
2012.
|
| Edición: | 1st ed. 2012. |
| Colección: | Springer Optimization and Its Applications,
62 |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Preface
- 1. Introduction
- 2. Greedy Strategy
- 3. Restriction
- 4. Partition
- 5. Guillotine Cut
- 6. Relaxation
- 7. Linear Programming
- 8. Primal-Dual Scheme and Local Ratio
- 9. Semidefinite Programming
- 10. Inapproximability
- Bibliography
- Index.