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

分布式距离近似

Distributed Distance Approximation

Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams

摘要:

直径、半径和偏心率是基本的图形参数,在各种计算环境中被广泛研究。通常,计算近似答案比计算精确解更有效。在本文中,我们给出了一个接近完整的表征近似比和轮复杂性的分布式算法近似这些参数之间的权衡,重点是加权和定向变量。此外,我们研究这些参数的\emph{bi-chromatic}变种定义在一个图的顶点是红色或蓝色,只专注于距离对顶点的颜色不同。受计算几何应用的启发,最近在连续设置中研究了双色直径、半径和偏心率[Backurs等人STOC'18,Dalirrooyfard等人ICALP'19]。我们提供了第一个分布式的上限和下限这样的问题。我们的技术贡献包括引入\emph{approximate pseudo-center}的概念,它扩展了[Choudhary和Gold SODA'20]的\emph{pseudo-centers},并提出了一个有效的分布式算法来计算近似伪中心。在下界方面,我们的建设引入了新的功能,从2方通信复杂性的分布式算法的减少框架的使用。

英文摘要:

Diameter, radius and eccentricities are fundamental graph parameters, which are extensively studied in various computational settings. Typically, computing approximate answers can be much more efficient compared with computing exact solutions. In this paper, we give a near complete characterization of the trade-offs between approximation ratios and round complexity of distributed algorithms for approximating these parameters, with a focus on the weighted and directed variants. Furthermore, we study \emph{bi-chromatic} variants of these parameters defined on a graph whose vertices are colored either red or blue, and one focuses only on distances for pairs of vertices that are colored differently. Motivated by applications in computational geometry, bi-chromatic diameter, radius and eccentricities have been recently studied in the sequential setting [Backurs et al. STOC'18, Dalirrooyfard et al. ICALP'19]. We provide the first distributed upper and lower bounds for such problems. Our technical contributions include introducing the notion of \emph{approximate pseudo-center}, which extends the \emph{pseudo-centers} of [Choudhary and Gold SODA'20], and presenting an efficient distributed algorithm for computing approximate pseudo-centers. On the lower bound side, our constructions introduce the usage of new functions into the framework of reductions from 2-party communication complexity to distributed algorithms.

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

↑