10 citations · 21 across the 15 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021★ 1 cited
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics
Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
K-median and k-means are the two most popular objectives for clustering algorithms. Despite intensive effort, a good understanding of the approximability of these objectives, parti…
cs.DS2021★ 5 cited
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis +2
We consider the numerical taxonomy problem of fitting a positive distance function by a tree metric. We want a tree with positive e…