arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.04989cs.CG
收藏

随机$k$ -中心和$j$ -平坦中心问题

Stochastic $k$-Center and $j$-Flat-Center Problems

Lingxiao Huang, Jian Li

摘要:

求解不确定数据上的几何优化问题在许多应用中变得越来越重要,近年来引起了人们的广泛关注。本文研究了欧几里得空间中随机/不确定数据点上的两个重要几何优化问题:$k$ -中心问题和$j$ -平坦中心问题。对于随机$k$ -中心问题,我们希望在固定维的欧氏空间中找到$k$点,使得$k$ -中心目标的期望值最小化。对于随机$j$ -平坦中心问题,我们寻求一个$j$ -平坦(即,$j$维仿射子空间),使得从任何点到$j$ -平坦的最大距离的期望值最小化。我们考虑两个流行的随机几何模型,存在的不确定性模型,其中每个点的存在可能是不确定的,和位置的不确定性模型,其中每个点的位置可能是不确定的问题。在这两种模型下,我们为这两个问题提供了第一个PTAS(多项式时间近似方案)。我们的结果推广了以前关于随机最小封闭球和随机封闭柱的结果。

英文摘要:

Solving geometric optimization problems over uncertain data have become increasingly important in many applications and have attracted a lot of attentions in recent years. In this paper, we study two important geometric optimization problems, the $k$-center problem and the $j$-flat-center problem, over stochastic/uncertain data points in Euclidean spaces. For the stochastic $k$-center problem, we would like to find $k$ points in a fixed dimensional Euclidean space, such that the expected value of the $k$-center objective is minimized. For the stochastic $j$-flat-center problem, we seek a $j$-flat (i.e., a $j$-dimensional affine subspace) such that the expected value of the maximum distance from any point to the $j$-flat is minimized. We consider both problems under two popular stochastic geometric models, the existential uncertainty model, where the existence of each point may be uncertain, and the locational uncertainty model, where the location of each point may be uncertain. We provide the first PTAS (Polynomial Time Approximation Scheme) for both problems under the two models. Our results generalize the previous results for stochastic minimum enclosing ball and stochastic enclosing cylinder.

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

↑