arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.14542cs.DC
收藏

LOCAL模型中的常返问题

Recurrent Problems in the LOCAL model

Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran

摘要:

本文考虑了Schmid和Suomela [HotSDN'13]提出的分布式计算的扩展模型,推广了扩展模型和CONGEST模型。在这个框架中,同一问题的多个实例,由于它们所应用的子网而彼此不同,随着时间的推移而重复出现,并且需要在线有效地解决。要做到这一点,可以依赖于初始预处理阶段来计算一些有用的信息。在某些情况下,这个预处理阶段可以克服基于本地的时间下限。本文的第一个贡献是扩大了问题类型的频谱,该模型适用于。除了子网络定义的经常性问题,我们还介绍了两种额外类型的经常性问题:(i)由部分客户端集定义的实例,以及(ii)由部分固定输出定义的实例。我们的第二个贡献是说明的多功能性,通过检查三个经典的图形问题的经常性的变种的CANORTED框架。第一个问题是最小客户支配集(CDS),经典的支配集问题的递归版本,每个递归实例要求我们支配一个部分客户集。我们提供了一个常数时间近似计划的CDS树和平面图。第二个问题是颜色完成(CC),这是着色问题的递归版本,其中每个递归实例都带有必须完成的部分固定着色(某些顶点)。我们研究完成这项任务所需的新颜色的最小数量和颜色的最小总数。第三个问题,我们研究的是一个经常性的版本的本地可检查标签(LCL)的路径长度$n$。我们证明了此类问题具有$Θ(1)$或$Θ(n)$的复杂性,扩展了Foerster等人的结果。[INFOCOM'19]。

英文摘要:

The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by the subnetwork to which they apply, recur over time, and need to be solved efficiently online. To do that, one may rely on an initial preprocessing phase for computing some useful information. This preprocessing phase makes it possible, in some cases, to overcome locality-based time lower bounds. A first contribution of the current paper is expanding the spectrum of problem types to which the SUPPORTED model applies. In addition to subnetwork-defined recurrent problems, we introduce also recurrent problems of two additional types: (i) instances defined by partial client sets, and (ii) instances defined by partially fixed outputs. Our second contribution is illustrating the versatility of the SUPPORTED framework by examining recurrent variants of three classical graph problems. The first problem is Minimum Client Dominating Set (CDS), a recurrent version of the classical dominating set problem with each recurrent instance requiring us to dominate a partial client set. We provide a constant time approximation scheme for CDS on trees and planar graphs. The second problem is Color Completion (CC), a recurrent version of the coloring problem in which each recurrent instance comes with a partially fixed coloring (of some of the vertices) that must be completed. We study the minimum number of new colors and the minimum total number of colors necessary for completing this task. The third problem we study is a recurrent version of Locally Checkable Labellings (LCL) on paths of length $n$. We show that such problems have complexities that are either $Θ(1)$ or $Θ(n)$, extending the results of Foerster et al. [INFOCOM'19].

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

↑