4 citations · 6 across the 10 of their papers we have counts for
1 paper · 1 filter
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.…