arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.09217cs.CGcs.DS
收藏

欧几里德色散问题的近似算法

Approximation Algorithms For The Euclidean Dispersion Problems

Pawan K. Mishra, Gautam K. Das

摘要:

在这篇文章中,我们考虑欧几里德色散问题。令$P=\{p_{1}, p_{2}, \ldots, p_{n}\}$是$\mathbb{R}^2$中的$n$点的集合。对于每个点$p \in P$和$S \subseteq P$,我们将$cost_γ(p,S)$定义为从$p$到$S \setminus \{p\}$中最近的$γ$点的欧几里得距离之和。我们为$S \subseteq P$定义了$cost_γ(S)=\min_{p \in S}\{cost_γ(p,S)\}$。在$γ$ -色散问题中,给出了$\mathbb{R}^2$中$n$点的集合$P$和正整数$k \in [γ+1,n]$.目标是找到大小为$k$的子集$S\subseteq P$,使得$cost_γ(S)$最大化。在$\mathbb{R}^2$中,我们同时考虑了$2$ -色散和$1$ -色散问题.随着这些,我们还考虑$2$ -分散问题时,点放在一条线上。在本文中,我们提出了一个简单的多项式时间$(2\sqrt 3 + ε)$因子近似算法的$2$色散问题,对任何$ε> 0$,这是一个改进的最佳已知的近似因子$4\sqrt3$ [Amano,K.和Nakano,S.一、$2$ -色散问题的近似算法,IEICE Transactions on Information and Systems,第103卷(3),pp. 506-508,2020]。接下来,我们开发了一个通用的框架,用于设计欧几里德色散问题的近似算法。在这个共同的框架下,我们改进了$\mathbb{R}^2$中$2$ -色散问题的$2\sqrt 3$近似因子.使用相同的框架,我们提出了一个多项式时间算法,它返回一个最佳的解决方案的$2$ -分散问题时,点被放置在一条线上。此外,为了证明该框架的有效性,我们还提出了一个$2$ -因子近似算法的$1$ -分散问题在$\mathbb{R}^2$。

英文摘要:

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_γ(p,S)$ as the sum of Euclidean distance from $p$ to the nearest $γ$ point in $S \setminus \{p\}$. We define $cost_γ(S)=\min_{p \in S}\{cost_γ(p,S)\}$ for $S \subseteq P$. In the $γ$-dispersion problem, a set $P$ of $n$ points in $\mathbb{R}^2$ and a positive integer $k \in [γ+1,n]$ are given. The objective is to find a subset $S\subseteq P$ of size $k$ such that $cost_γ(S)$ is maximized. We consider both $2$-dispersion and $1$-dispersion problem in $\mathbb{R}^2$. Along with these, we also consider $2$-dispersion problem when points are placed on a line. In this paper, we propose a simple polynomial time $(2\sqrt 3 + ε)$-factor approximation algorithm for the $2$-dispersion problem, for any $ε> 0$, which is an improvement over the best known approximation factor $4\sqrt3$ [Amano, K. and Nakano, S. I., An approximation algorithm for the $2$-dispersion problem, IEICE Transactions on Information and Systems, Vol. 103(3), pp. 506-508, 2020]. Next, we develop a common framework for designing an approximation algorithm for the Euclidean dispersion problem. With this common framework, we improve the approximation factor to $2\sqrt 3$ for the $2$-dispersion problem in $\mathbb{R}^2$. Using the same framework, we propose a polynomial time algorithm, which returns an optimal solution for the $2$-dispersion problem when points are placed on a line. Moreover, to show the effectiveness of the framework, we also propose a $2$-factor approximation algorithm for the $1$-dispersion problem in $\mathbb{R}^2$.

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

↑