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

By: Du, Ding-Zhu [author.]
Contributor(s): Ko, Ker-I [author.] | Hu, Xiaodong [author.] | SpringerLink (Online service)
Material type: TextTextSeries: Springer Optimization and Its Applications: 62Publisher: New York, NY : Springer New York, 2012Description: XII, 440 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781461417019Subject(s): Mathematics | Algorithms | Mathematical optimization | Mathematics | Optimization | Algorithm Analysis and Problem ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 519.6 LOC classification: QA402.5-402.6Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

There are no comments for this item.

to post a comment.

Powered by Koha