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ón completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Du, Ding-Zhu (Autor), Ko, Ker-I (Autor), Hu, Xiaodong (Autor)
Autor Corporativo: SpringerLink (Online service)
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:
Mathematical optimization.
Algorithms.
Optimization.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-4614-1701-9
003 DE-He213
005 20220115070940.0
007 cr nn 008mamaa
008 111117s2012 xxu| s |||| 0|eng d
020 |a 9781461417019  |9 978-1-4614-1701-9 
024 7 |a 10.1007/978-1-4614-1701-9  |2 doi 
050 4 |a QA402.5-402.6 
072 7 |a PBU  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBU  |2 thema 
082 0 4 |a 519.6  |2 23 
100 1 |a Du, Ding-Zhu.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Design and Analysis of Approximation Algorithms  |h [electronic resource] /  |c by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu. 
250 |a 1st ed. 2012. 
264 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2012. 
300 |a XII, 440 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer Optimization and Its Applications,  |x 1931-6836 ;  |v 62 
505 0 |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. 
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. 
650 0 |a Mathematical optimization. 
650 0 |a Algorithms. 
650 1 4 |a Optimization. 
650 2 4 |a Algorithms. 
700 1 |a Ko, Ker-I.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Hu, Xiaodong.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781461417002 
776 0 8 |i Printed edition:  |z 9781489998446 
776 0 8 |i Printed edition:  |z 9781461417026 
830 0 |a Springer Optimization and Its Applications,  |x 1931-6836 ;  |v 62 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-4614-1701-9  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares