arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.08754cs.CG
收藏

邻近连通两中心问题的一个有效算法

An Efficient Algorithm for the Proximity Connected Two Center Problem

Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer

摘要:

给定平面上的一组$P$的$n$点,$k$ -中心问题是寻找具有最小可能半径的$k$全等圆盘,使得它们的并集覆盖$P$中的所有点. $2$ -中心问题是$k$ -中心问题的一个特例,在最近的\cite{CAHN,HT,SH}中已经得到了广泛的研究.在本文中,我们考虑$2$ -中心问题的一个广义版本,称为\textit{proximity connected} $2$ -中心(PCTC)问题。在这个问题中,我们还给定了一个参数$δ\geq 0$,并且我们有一个附加的约束,即圆盘中心之间的距离最多应该是$δ$。请注意,当$δ=0$时,PCTC问题被简化为$1$ -中心(最小包围盘)问题,当$δ$趋于无穷大时,它被简化为$2$ -中心问题. PCTC问题首次出现在1992年\cite{ACN0}的无线网络的背景下,但获得一个非平凡的确定性算法的问题仍然开放。在本文中,我们解决了这个开放的问题,提供了一个确定性的$O(n^2\log n)$时间算法的问题。

英文摘要:

Given a set $P$ of $n$ points in the plane, the $k$-center problem is to find $k$ congruent disks of minimum possible radius such that their union covers all the points in $P$. The $2$-center problem is a special case of the $k$-center problem that has been extensively studied in the recent past \cite{CAHN,HT,SH}. In this paper, we consider a generalized version of the $2$-center problem called \textit{proximity connected} $2$-center (PCTC) problem. In this problem, we are also given a parameter $δ\geq 0$ and we have the additional constraint that the distance between the centers of the disks should be at most $δ$. Note that when $δ=0$, the PCTC problem is reduced to the $1$-center(minimum enclosing disk) problem and when $δ$ tends to infinity, it is reduced to the $2$-center problem. The PCTC problem first appeared in the context of wireless networks in 1992 \cite{ACN0}, but obtaining a nontrivial deterministic algorithm for the problem remained open. In this paper, we resolve this open problem by providing a deterministic $O(n^2\log n)$ time algorithm for the problem.

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

↑