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

**Computational Geometry: Methods and Applications**

by

**Jianer Chen**

The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.

(

**11157**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**6951**views)

**LEDA: A Platform for Combinatorial and Geometric Computing**

by

**K. Mehlhorn, St. NĂ¤her**-

**Cambridge University Press**

The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.

(

**5342**views)

**Knapsack Problems: Algorithms and Computer Implementations**

by

**Silvano Martello, Paolo Toth**-

**John Wiley & Sons**

The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.

(

**11703**views)