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

树上图燃烧的改进近似算法

Improved Approximation Algorithm for Graph Burning on Trees

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S

摘要:

给定一个图$G=(V,E)$,\gb{}的问题是从图$V$中找出一个节点序列,称为烧序列,以烧完整个图.这是一个离散步骤的过程,在每一步中,一个未燃烧的顶点被选为代理,通过将其标记为燃烧节点来将火传播到其邻居。被烧毁的节点在下一个连续步骤中将火传播到其邻居。目标是找到最小长度的燃烧序列。\gb{}问题对于一般图甚至二叉树都是NP难的。一些近似结果是已知的,包括一般图的$3$ -近似算法和树的$2$ -近似算法。在本文中,我们提出了一个近似算法的树木,产生的燃烧序列的长度最多为$\lfloor 1.75b(T) \rfloor + 1$,其中$b(T)$是最佳燃烧序列的长度,也称为燃烧数的树$T$。换句话说,我们实现了$(\lfloor 1.75b(T) \rfloor + 1)/b(T)$的近似因子。

英文摘要:

Given a graph $G=(V,E)$, the problem of \gb{} is to find a sequence of nodes from $V$, called burning sequence, in order to burn the whole graph. This is a discrete-step process, in each step an unburned vertex is selected as an agent to spread fire to its neighbors by marking it as a burnt node. A node that is burnt spreads the fire to its neighbors at the next consecutive step. The goal is to find the burning sequence of minimum length. The \gb{} problem is NP-Hard for general graphs and even for binary trees. A few approximation results are known, including a $3$-approximation algorithm for general graphs and a $2$- approximation algorithm for trees. In this paper, we propose an approximation algorithm for trees that produces a burning sequence of length at most $\lfloor 1.75b(T) \rfloor + 1$, where $b(T)$ is length of the optimal burning sequence, also called the burning number of the tree $T$. In other words, we achieve an approximation factor of $(\lfloor 1.75b(T) \rfloor + 1)/b(T)$.

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

↑