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

(

**10143**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**

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.

(

**11276**views)

**Algorithms for Modular Elliptic Curves**

by

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

(

**9739**views)

**Tabu Search**

by

**Wassim Jaziri**-

**InTech**

Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.

(

**8302**views)