稀疏图上局部算法的变体
Variants of local algorithms on sparse graphs
AI总结:
本文研究有界度稀疏图上局部算法的不同扩展,证明带预处理的近似最优局部算法可由无需预处理、仅使用全局随机化的局部算法等价替代。
摘要:
假设我们希望在一个有界度图上构造某种结构,例如近似最大匹配,并且希望仅依据每条边的常数半径邻域来对其作出决策。我们考察并比较了这些局部算法不同扩展形式的能力。一种常见扩展是使用预处理,这意味着我们可以对整张图进行某些计算,而每个局部决策也可以依赖于这一计算。在本文中,我们证明预处理是不必要的:如果一个近似最优的局部算法使用了预处理,那么同样的目标也可以由一个不使用预处理、但采用全局随机化的局部算法实现。
英文摘要:
Suppose we want to construct some structure on a bounded-degree graph, e.g., an almost maximum matching, and we want to decide about each edge depending only on its constant-radius neighborhood. We examine and compare the strengths of different extensions of these local algorithms. A common extension is to use preprocessing, which means that we can make some calculation about the whole graph, and each local decision can also depend on this calculation. In this paper, we show that preprocessing is needless: if a nearly optimal local algorithm uses preprocessing, then the same can be achieved by a local algorithm without preprocessing, but with a global randomization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。