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

高动态网络的快速确定性算法

Fast Deterministic Algorithms for Highly-Dynamic Networks

Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman

摘要:

本文提供了一个算法框架,用于获得快速分布式算法的高度动态设置,其中 * 任意多 * 边的变化可能会发生在每一轮。我们的算法显着改善了以前的工作,在其组合(1)具有$O(1)$摊销的时间复杂度,(2)只使用$O(\log{n})$位消息,(3)不构成任何限制的动态行为的环境,(4)是确定性的,(5)有很强的保证中间的解决方案,(6)适用于广泛的家庭的任务。我们推导出这样一个算法的任务是最大匹配,$(degree+1)$着色,2-近似最小权顶点覆盖,和最大独立集(这是最微妙的情况)。对于这些任务中的一些,节点插入也可以是允许的拓扑变化之一,并且对于其中的一些,也可以是突然的节点删除。

英文摘要:

This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combination of (1) having an $O(1)$ amortized time complexity, (2) using only $O(\log{n})$-bit messages, (3) not posing any restrictions on the dynamic behavior of the environment, (4) being deterministic, (5) having strong guarantees for intermediate solutions, and (6) being applicable for a wide family of tasks. The tasks for which we deduce such an algorithm are maximal matching, $(degree+1)$-coloring, 2-approximation for minimum weight vertex cover, and maximal independent set (which is the most subtle case). For some of these tasks, node insertions can also be among the allowed topology changes, and for some of them also abrupt node deletions.

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

↑