Design and Analysis of Approximation Algorithms

From the reviews:

“This book is intended for graduate courses of different levels, and course plans based on different chapter selections are proposed. Each chapter is accompanied by several pages of exercises and historical notes, setting the material and the references in context. The comprehensive bibliography covers a huge amount of literature in the heuristics and approximations area, as well as specific application problems. The index is detailed. This makes the book a good source for a course on approximation algorithms. ...For the more advanced reader the book seems to be an excellent in-depth resource on approximation algorithms, for their beginning up to the latest developments.”

—Gudula Runger,
Computing Reviews

“It contains a large amount of precisely selected topics covering various aspects and design techniques related to approximation algorithms. … It has been intended as a textbook for a graduate course in theoretical computer science. … it can also be used as a reference book for postgraduate students and researchers in the area of design and analysis of algorithms. It also serves as a reference for established researchers by providing efficient tools for various applied areas like applied mathematics, engineering, medicine, economics, and other sciences.” (Vladimír

Lacko, Zentralblatt MATH, Vol. 1237, 2012)

“This textbook organizes approximation algorithms into chapters based on the design techniques. … this book is particularly suited for students who, possibly starting from scratch, want to first encounter, then absorb, and finally master the main techniques which have emerged as general paradigms in the design of approximation algorithms. This includes self-study by novices … but also teaching by experts in standard courses.” (Romeo Rizzi, Mathematical Reviews, January, 2013)