Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics

Hyung-Chan An, Mong-Jen Kao, Changyeol Lee +1

We consider the classic correlation clustering problem in the hierarchical setting. Given a complete graph $G=(V,E)$ and $\ell$ layers of input information, where the input of each…