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

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Du, Dingzhu, 1948-, Ko, Ker-I (Autor), Hu, Xiaodong (Autor)
Format: Livre numérique
Idioma:Anglais
Publicat: New York, NY : Springer New York [20..].
Cham : Springer Nature
Edició:1st ed. 2012.
Col·lecció:Springer Optimization and Its Applications 62
Accés en línia:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: 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
LEADER 03758nam a22004217a 4500
001 973831
008 120110q2000 xx ||| |||| 00| 0 eng d
009 PPN15750977X
020 |a 9781461417019  |z 9781461417019 
020 |a 9781461417019 
041 0 |a eng 
082 |a 519.6 
100 1 |a Du, Dingzhu,  |d 1948- 
245 1 0 |a Design and analysis of approximation algorithms   |c Ding-Zhu Du, Ker-I Ko, Xiaodong Hu. 
250 |a 1st ed. 2012. 
260 |a New York, NY :  |b Springer New York. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Springer Optimization and Its Applications  |v 62  |x 1931-6836 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 1 |a 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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a 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 
520 |a 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 
700 1 |a Ko, Ker-I.  |4 aut 
700 1 |a Hu, Xiaodong.  |4 aut 
700 1 |a Ko, Ker-I.  |4 aut 
700 1 |a Hu, Xiaodong.  |4 aut 
776 0 |0 165947306  |t Design and Analysis of Approximation Algorithms  |f by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.  |d 2012  |c New York  |n Springer  |p 1 vol. (xi-440 p.)  |s Springer Optimization and Its Applications  |z 978-1-4614-1700-2 
776 0 |0 165947306  |t Design and Analysis of Approximation Algorithms  |f by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.  |d 2012  |c New York  |n Springer  |p 1 vol. (xi-440 p.)  |s Springer Optimization and Its Applications  |z 978-1-4614-1700-2 
776 0 |t Design and Analysis of Approximation Algorithms  |b Texte imprimé  |z 9781489998446 
776 0 |t Design and Analysis of Approximation Algorithms  |b Texte imprimé  |z 9781461417026 
856 4 |q PDF  |u https://doi.org/10.1007/978-1-4614-1701-9  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-Q5HF3QBC-4  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750607092  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-1-4614-1701-9  |z Accès Université d'Orléans 
856 4 |5 180339901:753966808  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-1-4614-1701-9  |z Accès INSA CVL 
997 |0 973831  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/