Parameterized complexity of firefighting ?
We study a generalization of the firefighter problem with b firefighters at each step. W[1]-hardness on bipartite graphs. Improved algorithms on trees. FPT results for bounded treewidth and planar graphs. No polynomial kernel on trees.
firefighter problem kernelization fixed parameter tractability