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
Algorithmic Mathematicsby Leonard Soicher, Franco Vivaldi - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(18216 views)
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.
(6400 views)
Data Structures and Algorithms: Annotated Reference with Examplesby Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(13693 views)
Algorithms for Modular Elliptic Curvesby J. E. Cremona - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(12303 views)