拥挤模型下度量无容量约束设施选址问题的分布式近似算法
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
摘要:
针对度量无容量限制的设施选址问题,提出了一种随机分布的近似算法。该算法在拥塞模型中的二分图上执行,产生(1.861 + λ)近似因子,其中λ是任意小的正常数。它需要O(n^{3/4} log_{1+epsilon} ^2(n)个具有高概率的通信回合(n表示设施和客户端的数量)。据我们所知,我们的算法目前有最好的近似因子的设施选址问题在分布式设置。它基于Jain等人的贪婪顺序近似算法(J. ACM 50(6),第795-824页,2003)。执行这种顺序算法的主要困难在于处理这样的情况,即多个设施有资格打开,但是(为了保持顺序算法的近似因子)实际上只有它们的子集可以打开。请注意,虽然我们的算法的运行时界限是“具有高概率”,但近似因子不是“在预期中”,而是始终保证为(1.861 + 1)。因此,我们的主要贡献是一个次线性的时间选择机制,同时增加了一个任意的小加法项的近似因子,使我们能够决定哪些符合条件的设施开放。
英文摘要:
We present a randomized distributed approximation algorithm for the metric uncapacitated facility location problem. The algorithm is executed on a bipartite graph in the Congest model yielding a (1.861 + epsilon) approximation factor, where epsilon is an arbitrary small positive constant. It needs O(n^{3/4}log_{1+epsilon}^2(n) communication rounds with high probability (n denoting the number of facilities and clients). To the best of our knowledge, our algorithm currently has the best approximation factor for the facility location problem in a distributed setting. It is based on a greedy sequential approximation algorithm by Jain et al. (J. ACM 50(6), pages: 795-824, 2003). The main difficulty in executing this sequential algorithm lies in dealing with situations, where multiple facilities are eligible for opening, but (in order to preserve the approximation factor of the sequential algorithm) only a subset of them can actually be opened. Note that while the presented runtime bound of our algorithm is "with high probability", the approximation factor is not "in expectation" but always guaranteed to be (1.861 + epsilon). Thus, our main contribution is a sublinear time selection mechanism that, while increasing the approximation factor by an arbitrary small additive term, allows us to decide which of the eligible facilities to open.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。