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
Design and Analysis of Computer Algorithmsby David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(13120 views)
Algorithms and Data Structuresby Niklaus Wirth - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
(12329 views)
Algorithmsby Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(11090 views)
Randomized Algorithmsby Wolfgang Merkle - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(7139 views)