The book is organized around several central algorithmic techniques for designing approximation algorithms including greedy and local search algorithms dynamic programming linear and semidefinite programming and randomization. Definition 11an approximation algorithmfor an optimization problem is a polynomial time algorithm that for all instances of the problem produces a solution whose value is within a factor of of the value of an optimal solution foran approximationalgorithm wewillcalltheperformance guaranteeof thealgorithm. 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 each chapter in the first section is devoted to a single algorithmic technique applied to several different problems with more sophisticated treatment . 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 each chapter in the first part of the book is devoted