In the minimum multicut problem one is given a set of $k$ pairs of nodes
and the aim is to find a minimum capacity cut that separates every pair.
This problem is a natural generalization of the minimum (s,t)-cut problem.
I will present an $O(log k)$-approximation algorithm due to Garg, Vazirani & Yanakakis.