Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Heidrich, Holger"'
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. This improves upon the previous best known approximation guarantees of
Externí odkaz:
http://arxiv.org/abs/2310.09196
Publikováno v:
Proceedings of SPIE; Nov2000, Issue 1, p192-197, 6p
Autor:
Schwerdtner, Armin, Heidrich, Holger
Publikováno v:
Proceedings of SPIE; Nov1998 Part 2, Issue 1, p203-210, 8p
Autor:
Heidrich, Holger, Knöller, Friedrich
Publikováno v:
Manuscripta Mathematica; 1987, Vol. 57 Issue 3, p249-262, 14p