Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering

by   Vaggos Chatziafratis, et al.

We present hardness of approximation results for Correlation Clustering with local objectives and for Hierarchical Clustering with dissimilarity information. For the former, we study the local objective of Puleo and Milenkovic (ICML '16) that prioritizes reducing the disagreements at data points that are worst off and for the latter we study the maximization version of Dasgupta's cost function (STOC '16). Our APX hardness results imply that the two problems are hard to approximate within a constant of 4/3   1.33 (assuming P vs NP) and 9159/9189   0.9967 (assuming the Unique Games Conjecture) respectively.


page 1

page 2

page 3

page 4


The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems

The Super-SAT or SSAT problem was introduced by Dinur, Kindler, Raz and ...

Clustering is Easy When ....What?

It is well known that most of the common clustering objectives are NP-ha...

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering

Recently, Hierarchical Clustering (HC) has been considered through the l...

Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT

In this paper, we study a number of well-known combinatorial optimizatio...

StoqMA vs. MA: the power of error reduction

StoqMA characterizes the computational hardness of stoquastic local Hami...

Hardness of Approximation of Euclidean k-Median

The Euclidean k-median problem is defined in the following manner: given...

Tight Approximation Ratio for Minimum Maximal Matching

We study a combinatorial problem called Minimum Maximal Matching, where ...