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

最终格线性算法

Eventually Lattice-Linear Algorithms

Arya Tanmay Gupta, Sandeep S Kulkarni

AI总结:

本文提出最终格线性算法,通过仅在状态空间子集上诱导格结构,为最小支配集、最小顶点覆盖、极大独立集、图着色和2-支配集等问题设计了自稳定算法,并证明其收敛速度优于现有方法。

摘要:

格线性系统允许节点异步执行。我们引入最终格线性算法,其中格仅在状态空间的一个子集内的状态之间被诱导出来。该算法保证系统会转移到其中一个格中的某个状态。然后,算法在通过该格遍历到最优状态的过程中表现出格线性行为。我们针对基于服务需求的最小支配集(SDMDS)问题提出了一种格线性自稳定算法。以此为例,我们详细阐述最终格线性算法的工作方式并给出其定义。随后,我们针对最小顶点覆盖(MVC)、极大独立集(MIS)、图着色(GC)和2-支配集问题(2DS)提出了最终格线性自稳定算法。SDMDS、MVC和MIS的算法在1轮加上n次移动内收敛(在2n次移动以内),GC在n+4m次移动内收敛,2DS在1轮加上2n次移动内收敛(在3n次移动以内)。这些结果相比现有文献有所改进。我们还给出了实验结果以展示性能提升,证明了格线性的优势。

英文摘要:

Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the state space. The algorithm guarantees that the system transitions to a state in one of the lattices. Then, the algorithm behaves lattice linearly while traversing to an optimal state through that lattice. We present a lattice-linear self-stabilizing algorithm for service demand based minimal dominating set (SDMDS) problem. Using this as an example, we elaborate the working of, and define, eventually lattice-linear algorithms. Then, we present eventually lattice-linear self-stabilizing algorithms for minimal vertex cover (MVC), maximal independent set (MIS), graph colouring (GC) and 2-dominating set problems (2DS). Algorithms for SDMDS, MVCc and MIS converge in 1 round plus $n$ moves (within $2n$ moves), GC in $n+4m$ moves, and 2DS in 1 round plus $2n$ moves (within $3n$ moves). These results are an improvement over the existing literature. We also present experimental results to show performance gain demonstrating the benefit of lattice-linearity.

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

↑