Preface

Lecture notes for advanced algorithms, covering:

• Background: greedy, dynamic programming, flows, reductions

• Techniques: randomized, parameterized, approximation, exact exponential algorithms

• Combined paradigms: parameterized approxmation, randomized rounding, randomized methods in parameterized algorithms

• Hardness of approximation, subexponential, and FPT algorithms