The Design of Approximation Algorithms
by D. P. Williamson, D. B. Shmoys
Publisher: Cambridge University Press 2010
ISBN/ASIN: 0521195276
ISBN-13: 9780521195270
Number of pages: 496
Description:
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
Download or read it online for free here:
Download link
(2.3MB, PDF)
Similar books
Introduction to Design Analysis of Algorithmsby K. Raghava Rao - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
(9324 views)
Average Case Analysis of Algorithms on Sequencesby Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(9933 views)
Greedy Algorithmsby Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
(12290 views)
Algorithmsby Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(8944 views)