The graph burning problem is an NP-Hard optimization problem that models the sequential spread of information over a network. Due to its nature, this problem has been approached through approximation algorithms and heuristics. This paper introduces a new 3-2/b(G)-approximation algorithm for the graph burning problem over general graphs, where b(G) is the size of an optimal solution. This algorithm, named 'burning greedy permutation' algorithm, is based on greedy permutations and is easy to implement. According to a brief empirical analysis, the proposed algorithm generates competitive solutions, some of which are better than the best previously known.

中文翻译：

---

图燃烧问题的3-2 / b（G）逼近算法

图燃烧问题是NP-Hard优化问题，它对信息在网络上的顺序传播建模。由于其性质，已经通过近似算法和启发式方法解决了该问题。本文针对一般图上的图燃烧问题，介绍了一种新的3-2 / b（G）逼近算法，其中b（G）是最优解的大小。该算法名为“燃烧贪婪置换”算法，它基于贪婪置换，易于实现。根据简短的经验分析，提出的算法可生成竞争解决方案，其中一些解决方案比以前最好的解决方案要好。