Clustering with Locally Bounded Ignorance

Jaroslav Garvardt, Christian Komusiewicz

In Correlation Clustering, the input is a graph $G=(V,E)$ with weight function $\ddot{I}‰:\left(\genfrac{}{}{0ex}{}{V}{2}\right)\to Z$ and the task is to partition the vertex set into clusters such that the tota…