最大化不相交球体或球体的半径和
Maximizing the Sum of Radii of Disjoint Balls or Disks
摘要:
在任意度量空间中寻找具有给定圆心的非重叠球,最大化球的半径和,可以表示为线性规划。它的对偶线性规划表达了在一个完全几何图中寻找一个覆盖所有顶点的最小权圈集(允许2-圈)的问题。对于任意有限维欧氏空间$d$中的点,对该空间上的任意凸距离函数,该图都可以用一个稀疏子图来代替,该稀疏子图服从一个分离子定理。这种图形结构导致了一种算法,用于在时间上找到最佳的球集$O(n^{2-1/d})$,从而改进了朴素循环覆盖算法的$O(n^3)$时间。作为一个子程序,我们提供了一个算法的加权二部匹配图的分隔符,这加快了最好的以前的算法,这个问题的平面二部图从$O(n^{3/2}\log n)$到$O(n^{3/2})$的时间。我们还展示了如何约束球的半径至少有一个给定的阈值,以及如何将我们的半径和优化算法的问题嵌入到一个星度量最小化的平均距离枢纽的有限度量空间。
英文摘要:
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles (allowing 2-cycles) covering all vertices in a complete geometric graph. For points in a Euclidean space of any finite dimension~$d$, with any convex distance function on this space, this graph can be replaced by a sparse subgraph obeying a separator theorem. This graph structure leads to an algorithm for finding the optimum set of balls in time $O(n^{2-1/d})$, improving the $O(n^3)$ time of a naive cycle cover algorithm. As a subroutine, we provide an algorithm for weighted bipartite matching in graphs with separators, which speeds up the best previous algorithm for this problem on planar bipartite graphs from $O(n^{3/2}\log n)$ to $O(n^{3/2})$ time. We also show how to constrain the balls to all have radius at least a given threshold value, and how to apply our radius-sum optimization algorithms to the problem of embedding a finite metric space into a star metric minimizing the average distance to the hub.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。