A 4-approximation algorithm for min max correlation clustering

Holger Heidrich, Jannik Irmai, Bjoern Andres

We introduce a lower bounding technique for the min max correlation clustering problem and, based on this technique, a combinatorial 4-approximation algorithm for complete graphs.…