arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.17080cs.DMcs.DSmath.CO
收藏

求解大规模图的图燃烧问题

Solving the Graph Burning Problem for Large Graphs

Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys Yunes, Luiz Fernando Batista Morato

AI总结:

本文提出一种基于集合覆盖整数规划模型和行生成算法的图燃烧问题精确求解方法,平均比现有最快算法快236倍,并将可求解最优解的现实图规模扩大了14倍。

摘要:

我们针对图燃烧问题(Graph Burning Problem, $\texttt{GBP}$)提出了一种精确算法,该问题是一个NP困难的优化问题,用于建模社交网络中影响力的传播。给定一个具有顶点集$V$的图$G$,目标是找到$V$中$k$个顶点的序列,即$v_1, v_2, \dots, v_k$,使得$k$最小且$\bigcup_{i = 1}^{k} \{u\\! \in\\! V\\! : d(u, v_i) \leq k - i\} = V$,其中$d(u,v)$表示$u$和$v$之间的距离。我们将该问题表述为集合覆盖整数规划模型,并为$\texttt{GBP}$设计了一种行生成算法。我们的方法利用了这样一个事实:极少量的覆盖约束通常就足以求解该整数模型,从而允许按需生成相应的行。迄今为止,$\texttt{GBP}$最高效的精确算法(此处记为$\texttt{GDCA}$)能够在两小时的执行时间内获得多达14,000个顶点的图的最优解。相比之下,我们的算法平均比$\texttt{GDCA}$快约236倍找到可证明的最优解。对于更大的图,内存空间成为$\texttt{GDCA}$的限制因素。然而,我们的算法在不到35秒内解决了具有近200,000个顶点的现实实例,将已知最优解的图规模提高了14倍。

英文摘要:

We propose an exact algorithm for the Graph Burning Problem ($\texttt{GBP}$), an NP-hard optimization problem that models the spread of influence on social networks. Given a graph $G$ with vertex set $V$, the objective is to find a sequence of $k$ vertices in $V$, namely, $v_1, v_2, \dots, v_k$, such that $k$ is minimum and $\bigcup_{i = 1}^{k} \{u\! \in\! V\! : d(u, v_i) \leq k - i\} = V$, where $d(u,v)$ denotes the distance between $u$ and $v$. We formulate the problem as a set covering integer programming model and design a row generation algorithm for the $\texttt{GBP}$. Our method exploits the fact that a very small number of covering constraints is often sufficient for solving the integer model, allowing the corresponding rows to be generated on demand. To date, the most efficient exact algorithm for the $\texttt{GBP}$, denoted here by $\texttt{GDCA}$, is able to obtain optimal solutions for graphs with up to 14,000 vertices within two hours of execution. In comparison, our algorithm finds provably optimal solutions approximately 236 times faster, on average, than $\texttt{GDCA}$. For larger graphs, memory space becomes a limiting factor for $\texttt{GDCA}$. Our algorithm, however, solves real-world instances with almost 200,000 vertices in less than 35 seconds, increasing the size of graphs for which optimal solutions are known by a factor of 14.

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

↑