Preprint
Aug 2026
Correlation Clustering with Random Partial Information
For graph instances both for the min-max and the min-disagreement objectives, this work proves approximation guarantees that are substantially better than the bounds achievable for general graphs.
N. RajathRaoK., Jens Schlöter, Sami Davies et al.
· 0 citations