Faster heuristics for graph burning
Graph burning is a process of information spreading through the network by an agent in
discrete steps. The problem is to find an optimal sequence of nodes that have to be given
information so that the network is covered in least number of steps. Graph burning problem
is NP-Hard for which two approximation algorithms and a few heuristics have been
proposed in the literature. In this work, we propose three heuristics, namely, Backbone
Based Greedy Heuristic (BBGH), Improved Cutting Corners Heuristic (ICCH), and …
discrete steps. The problem is to find an optimal sequence of nodes that have to be given
information so that the network is covered in least number of steps. Graph burning problem
is NP-Hard for which two approximation algorithms and a few heuristics have been
proposed in the literature. In this work, we propose three heuristics, namely, Backbone
Based Greedy Heuristic (BBGH), Improved Cutting Corners Heuristic (ICCH), and …
[HTML][HTML] Faster heuristics for graph burning
AS Kare - Applied Intelligence - academia.edu
Graph burning is a process of information spreading through the network by an agent in
discrete steps. The problem is to find an optimal sequence of nodes that have to be given
information so that the network is covered in least number of steps. Graph burning problem
is NP-Hard for which two approximation algorithms and a few heuristics have been
proposed in the literature. In this work, we propose three heuristics, namely, Backbone
Based Greedy Heuristic (BBGH), Improved Cutting Corners Heuristic (ICCH), and …
discrete steps. The problem is to find an optimal sequence of nodes that have to be given
information so that the network is covered in least number of steps. Graph burning problem
is NP-Hard for which two approximation algorithms and a few heuristics have been
proposed in the literature. In this work, we propose three heuristics, namely, Backbone
Based Greedy Heuristic (BBGH), Improved Cutting Corners Heuristic (ICCH), and …
Showing the best results for this search. See all results