Firefighting is a combinatorial optimization problem on graphs that models the problem of determining the optimal strategy to contain a fire and save as much from the fire as possible. We introduce and study a new version of firefighting, Politician’s Firefighting, which exhibits more locality than the classical one-firefighter version. We prove that this locality allows us to develop an O(bn)-time algorithm on trees, where b is the number of nodes initially on fire. We further prove that Politician’s Firefighting is NP-hard on planar graphs of degree at most 5. We present an O(m+ k 2.5 4 k )-time algorithm for this problem on general graphs, where k is the number of nodes that burn using the optimal strategy, thereby proving that it is fixed-parameter tractable. We present experimental results that show that our algorithm’s search-tree size is in practice much smaller than the worst-case bound of 4 k .
KeywordsOptimal Strategy Bipartite Graph Planar Graph Search Tree Vertex Cover
Unable to display preview. Download preview PDF.
- 1.Finbow, S., King, A., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. In: Proceedings of the European Conference ond Combinatorics, Graph Theory and Applications (2003)Google Scholar
- 2.Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the 6th ACM Symposium on the Theory of Computing, pp. 47–63 (1974)Google Scholar
- 3.Hartke, S.G.: Graph-Theoretic Models of Spread and Competition. PhD thesis, Rutgers University (2004)Google Scholar
- 4.Hartnell, B.: Firefighter! an application of domination. In: The 24th Manitoba Conference on Combinatioral Mathematics and Computing (1995)Google Scholar
- 7.Roberts, F.: Challenges for discrete mathematics and theoretical computer science in the defense against bioterrorism. In: SIAM Frontiers in Applied Mathematics, pp. 1–34 (2003)Google Scholar