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

树中的平方根:子树聚类和双曲裤分解

Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition

David Eppstein

摘要:

我们提供了有效的常数因子近似算法的问题,找到一个层次聚类的点集在任何度量空间,最小化的总和最小生成树长度内的每个集群,并在双曲或欧几里得平面,最小化的总和集群周长。我们的算法的双曲和欧几里德平面也可以用来提供一个裤子分解,也就是说,一组不相交的简单的封闭曲线分割的平面减去输入点到子集正好有三个边界组件,大约最小的总长度。在欧几里得的情况下,这些曲线是平方的;在双曲的情况下,它们结合了我们的欧几里得平方裤分解与我们的树聚类方法为一般度量空间。

英文摘要:

We provide efficient constant factor approximation algorithms for the problems of finding a hierarchical clustering of a point set in any metric space, minimizing the sum of minimimum spanning tree lengths within each cluster, and in the hyperbolic or Euclidean planes, minimizing the sum of cluster perimeters. Our algorithms for the hyperbolic and Euclidean planes can also be used to provide a pants decomposition, that is, a set of disjoint simple closed curves partitioning the plane minus the input points into subsets with exactly three boundary components, with approximately minimum total length. In the Euclidean case, these curves are squares; in the hyperbolic case, they combine our Euclidean square pants decomposition with our tree clustering method for general metric spaces.

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

↑