This text deals with algorithms designed for approximating solutions to a certain class of problems, called NP-hard combinatorial optimization problems. In particular, it focuses on the design of polynomial-time approximation algorithms.[...]