The design of approximation algorithms this is the companion website for the book the design of approximation algorithms by david p williamson and david b shmoys published by cambridge university press. In the design of approximation algorithms this perspective is from our background in the operations research and mathematical programming communities it is a little unusual in the computer science community and students coming from a computer science background may. 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. 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