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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Édition: | 1st ed. 2012. |
| Collection: | Springer Optimization and Its Applications
62 |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 |