局部逼近的下界
Lower Bounds for Local Approximation
摘要:
在确定性分布式算法的研究中,通常假设每个节点具有唯一的$O(\log n)$位标识符。我们证明,对于一般类的图问题,本地算法(恒定时间分布式算法)不需要这样的标识符:端口编号和方向是足够的。我们的结果适用于所谓的简单PO-可检查图优化问题,这包括许多经典的包装和覆盖问题,如顶点覆盖,边缘覆盖,匹配,独立集,控制集,和边缘控制集。我们专注于有界度图的情况下,并表明,如果一个本地算法发现一个简单的PO-可检查图的问题的帮助下,唯一标识符的常数因子近似,然后可以实现匿名网络上相同的近似比。作为我们结果的推论,并通过以前的工作,我们得到了一个紧的下限的局部逼近的最小边支配集问题。我们的主要技术工具是一个代数结构的均匀有序图:我们说,一个图是$(α,r)$ -齐,如果它的节点是线性有序的,使一个$α$分数的节点有成对同构半径- $r$邻域。证明了对任意$α< 1$和任意$r$、$k$和$g$,存在围长至少为$g$的有限$(α,r)$ -齐次$2k$ -正则图.
英文摘要:
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and orientation is sufficient. Our result holds for so-called simple PO-checkable graph optimisation problems; this includes many classical packing and covering problems such as vertex covers, edge covers, matchings, independent sets, dominating sets, and edge dominating sets. We focus on the case of bounded-degree graphs and show that if a local algorithm finds a constant-factor approximation of a simple PO-checkable graph problem with the help of unique identifiers, then the same approximation ratio can be achieved on anonymous networks. As a corollary of our result and by prior work, we derive a tight lower bound on the local approximability of the minimum edge dominating set problem. Our main technical tool is an algebraic construction of homogeneously ordered graphs: We say that a graph is $(α,r)$-homogeneous if its nodes are linearly ordered so that an $α$ fraction of nodes have pairwise isomorphic radius-$r$ neighbourhoods. We show that there exists a finite $(α,r)$-homogeneous $2k$-regular graph of girth at least $g$ for any $α< 1$ and any $r$, $k$, and $g$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。