Approximative Algorithmen und Nichtapproximierbarkeit

The subject matter of this textbook is the treatment of difficult to solve discrete optimisation problems. The first part presents fast algorithms which can provide approximate solutions to such problems. The second part deals with complexity theory and the non-approximability of optimisation problems. In addition, this textbook contains numerous application examples, exercises, illustrations and sections on the basics such as the Turing machine.