We are a group of students from Ariel University who worked on this project as our final assignment. We came together to dive into graph algorithms, aiming to build on and improve existing methods with fresh ideas and teamwork.

In our ongoing efforts to optimize the solutions of the algorithms in the article Approximability of the Firefighter Problem, we have focused on improving the existing minbudget algorithms. By applying a local search algorithm, we have been able to significantly enhance the performance and efficiency of these algorithms.

Our approach ensures that the resources required to contain and manage the spread of threats are minimized, providing a more effective and budget-conscious solution. This improvement reflects our commitment to advancing the methodologies used in this critical area.

Link to the open-source code: Github
Link to the Website, which allows you to display graphs and the algorithms execution on them: Website
Link for our article: Article