Free Computer Books Downloads and Reviews; from desktop to cloud computing...C++, C#, Java, ASP.NET, Silverlight, Cloud computing, Microsoft Expression Blend, Android, Unix, Operating Systems, PHP, Visual Basic, Mobile Phones...... Updated regularly....Keep visiting.....

Monday, 10 March 2014

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. 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. 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.

Title The Design of Approximation Algorithms
Author(s) David P. Williamson and David B. Shmoys
Publisher: Cambridge University Press; 1 edition (April 30, 2011)
Hardcover 500 pages
Language: English
ISBN-10: 0521195276
ISBN-13: 978-0521195270
eBook: http://www.designofapproxalgs.com/download.php

No comments:

Post a Comment

loading...

Search: