Design and Analysis of Approximation Algorithms / by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.

Springer eBooks

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.

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.