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

**Lecture Notes on Bucket Algorithms**

by

**Luc Devroye**-

**Birkhauser**

In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.

(

**6827**views)

**A Practical Introduction to Data Structures and Algorithm Analysis**

by

**Clifford A. Shaffer**-

**Virginia Tech**

A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.

(

**7922**views)

**Think Data Structures**

by

**Allen B. Downey**-

**Green Tea Press**

This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.

(

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

(

**11346**views)