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

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**8101**views)

**Essentials of Metaheuristics**

by

**Sean Luke**

This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.

(

**5611**views)

**Design and Analysis of Algorithms**

by

**Herbert Edelsbrunner**-

**Duke University**

The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.

(

**10921**views)

**Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design**

by

**Solomon I. Khmelnik**-

**MiC**

This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.

(

**4377**views)