arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.7318cs.CG
收藏

下边界快速聚类:没有太远的客户,没有太小的商店

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

Alina Ene, Sariel Har-Peled, Benjamin Raichel

摘要:

我们研究的\LowerBoundedCenter(\lbc)的问题,这是一个聚类问题,可以被看作是一个变种的\kCenter问题。在\lbc问题中,给定度量空间中的一组点P和一个下界λ,目标是选择一组中心C \subseteq P和一个将P中的每个点映射到C的中心的分配,使得C的每个中心被分配至少λ个点。分配的价格是一个点和它被分配到的中心之间的最大距离,目标是找到一组中心和最小价格的分配。对于\lbc问题,当输入点位于d维欧氏空间R^d(d为常数)时,给出了一个O(n \log n)时间的常数因子近似算法.我们还证明了这个问题不能在1.8-ε的因子内近似,除非P = \NP,即使输入点是欧几里得平面R^2上的点。

英文摘要:

We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter problem. In the \lbc problem, we are given a set of points P in a metric space and a lower bound λ, and the goal is to select a set C \subseteq P of centers and an assignment that maps each point in P to a center of C such that each center of C is assigned at least λpoints. The price of an assignment is the maximum distance between a point and the center it is assigned to, and the goal is to find a set of centers and an assignment of minimum price. We give a constant factor approximation algorithm for the \lbc problem that runs in O(n \log n) time when the input points lie in the d-dimensional Euclidean space R^d, where d is a constant. We also prove that this problem cannot be approximated within a factor of 1.8-εunless P = \NP even if the input points are points in the Euclidean plane R^2.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑