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...
Zapisane w:
| Główni autorzy: | , , |
|---|---|
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Wydanie: | 1st ed. 2012. |
| Seria: | Springer Optimization and Its Applications
62 |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Design and Analysis of Approximation Algorithms, by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu., 2012, New York, Springer, 1 vol. (xi-440 p.), Springer Optimization and Its Applications, 978-1-4614-1700-2 • Design and Analysis of Approximation Algorithms, by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu., 2012, New York, Springer, 1 vol. (xi-440 p.), Springer Optimization and Its Applications, 978-1-4614-1700-2 • Design and Analysis of Approximation Algorithms, Texte imprimé, 9781489998446 • Design and Analysis of Approximation Algorithms, Texte imprimé, 9781461417026 |
Spis treści:
- 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