This paper gives a pure dp algorithm for all the pairs min cut problem with the same error as private min-st-cut.

This paper improves approximation algorithms for Chromatic and pseudometric-weighted Correlation Clustering