Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, ...

 Randomized algorithms

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. Summary of contents Part 1 TOOLS AND TECHN...