The firefighter problem with more than one firefighter on trees

Details The firefighter problem with more than one firefighter on trees The firefighter problem with more than one firefighter on trees

2011-10-03

arxiv.org/abs/1110.0341v1

Computer Science

Discrete Mathematics

Scientific paper

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 $b \geq 2$ firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree $b+2$ and polynomial-time solvable for trees of maximum degree $b+2$ when the fire breaks out at a vertex of degree at most $b+1$. Moreover we present a polynomial-time algorithm for a subclass of trees, namely $k$-caterpillars.

Affiliated with

Also associated with

No associations

Rating

The firefighter problem with more than one firefighter on trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The firefighter problem with more than one firefighter on trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The firefighter problem with more than one firefighter on trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271084