The firefighter problem with more than one firefighter on trees
Cristina Bazgan, Morgan Chopin, Bernard Ries

TL;DR
This paper investigates the complexity of the firefighter problem on trees with multiple firefighters, establishing NP-completeness results and providing polynomial algorithms for specific tree subclasses.
Contribution
It extends the understanding of firefighter problem complexity on trees with multiple firefighters, answering open questions and identifying tractable subclasses.
Findings
NP-complete for trees with maximum degree b+2 when b ≥ 2
Polynomial-time solvable for trees of maximum degree b+1
Provides a polynomial algorithm for k-caterpillar trees
Abstract
In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of Finbow and MacGillivray 2009. More precisely, when firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree and polynomial-time solvable for trees of maximum degree when the fire breaks out at a vertex of degree at most . Moreover we present a polynomial-time algorithm for a subclass of trees, namely -caterpillars.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complexity and Algorithms in Graphs · Complex Network Analysis Techniques
