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

度量空间中色散问题的近似算法

Approximation Algorithms For The Dispersion Problems in a Metric Space

Pawan K. Mishra, Gautam K. Das

摘要:

在这篇文章中,我们考虑了度量空间$(X,d)$中的$c$ -色散问题。令$P=\{p_{1}, p_{2}, \ldots, p_{n}\}$是度量空间$(X,d)$中的$n$点的集合。对于每个点$p \in P$和$S \subseteq P$,我们将$cost_{c}(p,S)$定义为从$p$到$S \setminus \{p\}$中最近的$c $点的距离之和,其中$c\geq 1$是固定整数。我们为$S \subseteq P$定义了$cost_{c}(S)=\min_{p \in S}\{cost_{c}(p,S)\}$。在$c$ -色散问题中,给出了度量空间$(X,d)$中$n$点的集合$P$和正整数$k \in [c+1,n]$.目标是找到大小为$k$的子集$S\subseteq P$,使得$cost_{c}(S)$最大化。我们提出了一个简单的多项式时间贪婪算法,产生一个$2c$因子近似结果的$c$ -分散问题在度量空间。欧几里德度量空间$(X,d)$中的$c$ -色散问题的最著名结果是$2c^2$,其中$P \subseteq \mathbb{R}^2$和距离函数是欧几里德距离[ Amano,K.和Nakano,S.一、远离竞争对手,CCCG,第68 -71页,2018年]。我们还证明了度量空间中的$c$ -色散问题是$W[1]$ -困难的.

英文摘要:

In this article, we consider the $c$-dispersion problem in a metric space $(X,d)$. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in a metric space $(X,d)$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{c}(p,S)$ as the sum of distances from $p$ to the nearest $c $ points in $S \setminus \{p\}$, where $c\geq 1$ is a fixed integer. We define $cost_{c}(S)=\min_{p \in S}\{cost_{c}(p,S)\}$ for $S \subseteq P$. In the $c$-dispersion problem, a set $P$ of $n$ points in a metric space $(X,d)$ and a positive integer $k \in [c+1,n]$ are given. The objective is to find a subset $S\subseteq P$ of size $k$ such that $cost_{c}(S)$ is maximized. We propose a simple polynomial time greedy algorithm that produces a $2c$-factor approximation result for the $c$-dispersion problem in a metric space. The best known result for the $c$-dispersion problem in the Euclidean metric space $(X,d)$ is $2c^2$, where $P \subseteq \mathbb{R}^2$ and the distance function is Euclidean distance [ Amano, K. and Nakano, S. I., Away from Rivals, CCCG, pp.68-71, 2018 ]. We also prove that the $c$-dispersion problem in a metric space is $W[1]$-hard.

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

↑