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 .
The graph burning problem is an NP-Hard optimization problem that may be used to model social contagion and the sequential spread of information on simple graphs. This paper introduces a simple approximation algorithm for the graph burning problem over general graphs . The approximation factor of this algorithm is 3-2/b(G) , where b(G) is the size of an optimal solution. The proposed algorithm is based on farthest-first traversal, it is easy to implement , and according to a brief empirical analysis, it generates competitive solutions .
R
models
may be used to model social contagion and
R
over a network. Due to its nature, this problem has been approached through approximation algorithms and heuristics.
on simple graphs.
R
new 3-2/b(G)-approximation
simple approximation
A
. The approximation factor of this algorithm is 3-2/b(G)
R
This algorithm , named 'burning greedy permutation' algorithm,
The proposed algorithm
R
greedy permutations and
farthest-first traversal, it
R
. According
, and according
R
the proposed algorithm
it
D
, some of which are better than the best previously known