基于几何散列的高维流媒体设施定位
Streaming Facility Location in High Dimension via Geometric Hashing
摘要:
在欧几里得统一设施定位(UFL)中,输入是$\mathbb{R}^d$中的一组客户端,目标是放置设施来为它们服务,以便最小化打开设施加上连接客户端的总成本。研究了动态几何流的设置问题,其中客户端表示为网格$\{1,\ldots,Δ\}^d$中点的插入和删除序列,重点研究了\emph{high-dimensional regime},其中$d\cdot\logΔ$中的算法必须使用空间多项式。我们提出了一个新的算法框架,基于重要性抽样,$O(1)$ -近似UFL只使用$\mathrm{poly}(d\cdot\logΔ)$空间。这个框架很容易在两个过程中实现,一个用于采样点,另一个用于估计它们的贡献。在随机顺序流上,我们可以通过分别使用流的两部分来将其扩展为一次传递。我们的主要结果,为任意顺序的流,计算$O(d / \log d)$ -近似在一个通过结合两个不同的通行证。这改进了以前的算法,要么需要空间$\exp(d)$或只保证$O(d\cdot\log^2Δ)$ -近似,因此,我们的算法是第一个高维,以避免$O(\logΔ)$ -因子的近似,这是固有的广泛使用的四叉树分解。我们的改进是通过采用几何散列方案,映射点在$\mathbb{R}^d$到桶的有界直径,与关键属性,每一个点集足够小的直径被散列到几个桶。通过对这种散列应用另一种界限,我们还在一次通过中获得了$O(1 / ε)$近似,使用更大但仍然是次线性的空间$O(n^ε)$,其中$n$是客户端的数量。我们补充我们的结果表明$1.085$ -近似需要空间指数在$\mathrm{poly}(d\cdot\logΔ)$。
英文摘要:
In Euclidean Uniform Facility Location (UFL), the input is a set of clients in $\mathbb{R}^d$ and the goal is to place facilities to serve them, so as to minimize the total cost of opening facilities plus connecting the clients. We study the setting of dynamic geometric streams, where the clients are presented as a sequence of insertions and deletions of points in the grid $\{1,\ldots,Δ\}^d$, and we focus on the \emph{high-dimensional regime}, where the algorithm must use space polynomial in $d\cdot\logΔ$. We present a new algorithmic framework, based on importance sampling, for $O(1)$-approximation of UFL using only $\mathrm{poly}(d\cdot\logΔ)$ space. This framework is easy to implement in two passes, one for sampling points and the other for estimating their contribution. Over random-order streams, we can extend this to one pass by using the two halves of the stream separately. Our main result, for arbitrary-order streams, computes $O(d / \log d)$-approximation in one pass by combining the two passes differently. This improves upon previous algorithms that either need space $\exp(d)$ or only guarantee $O(d\cdot\log^2Δ)$-approximation, and therefore our algorithms for high dimension are the first to avoid the $O(\logΔ)$-factor in approximation that is inherent to the widely-used quadtree decomposition. Our improvement is achieved by employing a geometric hashing scheme that maps points in $\mathbb{R}^d$ into buckets of bounded diameter, with the key property that every point set of small-enough diameter is hashed into few buckets. By applying an alternative bound for this hashing, we also obtain an $O(1 / ε)$-approximation in one pass, using larger but still sublinear space $O(n^ε)$ where $n$ is the number of clients. We complement our results by showing $1.085$-approximation requires space exponential in $\mathrm{poly}(d\cdot\logΔ)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。