A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Resolving Conflicts for Lower-Bounded Clustering
2019
International Symposium on Parameterized and Exact Computation
This paper considers the effect of non-metric distances for lower-bounded clustering, i.e., the problem of computing a partition for a given set of objects with pairwise distance, such that each set has a certain minimum cardinality (as required for anonymisation or balanced facility location problems). We discuss lower-bounded clustering with the objective to minimise the maximum radius or diameter of the clusters. For these problems there exists a 2-approximation but only if the pairwise
doi:10.4230/lipics.ipec.2018.23
dblp:conf/iwpec/Casel18
fatcat:rtod6ytbzbf4to34agtg42lyxu