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$.
在欧几里德$k$ -均值问题中,我们给出了欧几里德空间中的$n$点的集合$D$和正整数$k$。我们的目标是在同一空间(中心)中识别一组$k$点,以最小化$D$中每个点与最近中心之间的欧氏距离平方和。已知该问题是APX困难的,并且当前最佳近似比是基于该问题的标准LP的原始-对偶$6.357$近似[Ahmadian et al. FOCS'17,SICOMP'20]。在本说明中,我们将展示如何一个小的修改艾哈迈迪等。的分析导致略微改进的$6.12903$近似。作为相关结果,我们还证明了所述线性规划至少具有$\frac{16+\sqrt{5}}{15}>1.2157$的完整性间隙.
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn(波恩大学离散数学研究所与豪斯多夫数学中心);Hamburg University of Technology, Institute for Algorithms and Complexity(汉堡工业大学算法与复杂性研究所)
A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
IT University of Copenhagen(哥本哈根信息技术大学);University of Copenhagen(哥本哈根大学);TU Braunschweig(布伦瑞克工业大学);Université Côte d’Azur(蔚蓝海岸大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所)