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...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Painos: | 1st ed. 2012. |
| Sarja: | Springer Optimization and Its Applications
62 |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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 |
| Yhteenveto: | 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 researchers in the area of design and analysis algorithms. There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach |
|---|---|
| Huomautukset: | Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| ISBN: | 9781461417019 |
| ISSN: | 1931-6836 |
| Pääsy: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |