Download The Design of Approximation Algorithms Pdf

Edition: 1
Release: 2011-04-26
Publisher: Cambridge University Press
Binding: Hardcover
ISBN/ASIN: 0521195276



The Design of Approximation Algorithms

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Free download The Design of Approximation Algorithms books collection in PDF, EPUB, FB2, MOBI, and TXT formats. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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. Best deals ebooks download The Design of Approximation Algorithms on amazon.Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. The Design of Approximation Algorithms with free ebook downloads available via rapidshare, mediafire, 4shared, and hotfile.

Download The Design of Approximation Algorithms