Abstract
The firefighter problem is defined as follows. Initially, a fire breaks out at a vertex r of a graph G. In each subsequent time unit, a firefighter chooses a vertex not yet on fire and protects it, and the fire spreads to all unprotected neighbors of the vertices on fire. The objective is to choose a sequence of vertices for the firefighter to protect so as to save the maximum number of vertices. The firefighter problem can be used to model the spread of fire, diseases, computer viruses and suchlike in a macro-control level.
In this paper, we study algorithmic aspects of the firefighter problem on trees, which is NP-hard even for trees of maximum degree 3. We present a (1 − 1/e)-approximation algorithm based on LP relaxation and randomized rounding, and give several FPT algorithms using a random separation technique of Cai, Chan and Chan. Furthermore, we obtain an \(2^{O(\sqrt{n}\log n)}\)-time subexponential algorithm.
Partially supported by Earmarked Research Grant 410206 of the Research Grants Council of Hong Kong SAR, China.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Chichester (1992)
Cai, L., Chan, S.M., Chan, S.O.: Random separation: A new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239–250. Springer, Heidelberg (2006)
Cai, L., Wang, W.: The surviving rate of a graph (manuscript, 2007)
Develin, M., Hartke, S.G.: Fire containment in grids of dimension three and higher. Discrete Appl. Math. 155(17), 2257–2268 (2007)
Finbow, S., King, A., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discrete Mathematics 307(16), 2094–2105 (2007)
Finbow, S., MacGillivray, G.: The firefighter problem: a survey (manuscript, 2007)
Fogarty, P.: Catching the Fire on Grids, M.Sc. Thesis, Department of Mathematics, University of Vermont (2003)
Hartke, S.G.: Attempting to narrow the integrality gap for the firefighter problem on trees. In: Discrete Methods in Epidemiology. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 70, pp. 179–185 (2006)
Hartnell, B.: Firefighter! An application of domination. In: 24th Manitoba Conference on Combinatorial Mathematics and Computing, University of Minitoba, Winnipeg, Cadada (1995)
Hartnell, B., Li, Q.: Firefighting on trees: how bad is the greedy algorithm? Congr. Numer. 145, 187–192 (2000)
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)
MacGillivray, G., Wang, P.: On the firefighter problem. J. Combin. Math. Combin. Comput. 47, 83–96 (2003)
Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: IEEE Symposium on Foundations of Computer Science, pp. 182–191 (1995)
Verbin, E.: Asymmetric universal sets (in preparation)
Wang, P., Moeller, S.: Fire control on graphs. J. Combin. Math. Combin. Comput. 41, 19–34 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, L., Verbin, E., Yang, L. (2008). Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-92182-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92181-3
Online ISBN: 978-3-540-92182-0
eBook Packages: Computer ScienceComputer Science (R0)