Abstract
The Firefighting problem is defined as follows. At time 
, a fire breaks out at a vertex of a graph. At each time step 
, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all undefended neighbors from the vertices on fire. This process stops when the fire cannot spread anymore. The goal is to find a sequence of vertices for the firefighter that maximizes the number of saved (non burned) vertices.
The Firefighting problem turns out to be \(\mathsf {NP}\)-hard even when restricted to bipartite graphs or trees of maximum degree three. We study the parameterized complexity of the Firefighting problem for various structural parameterizations. All our parameters measure the distance to a graph class (in terms of vertex deletion) on which the Firefighting problem admits a polynomial time algorithm. Specifically, for a graph class 
and a graph 
, a vertex subset 
is called a modulator to 
if 
belongs to 
. The parameters we consider are the sizes of modulators to graph classes such as threshold graphs, bounded diameter graphs, disjoint unions of stars, and split graphs.
To begin with, we show that the problem is \(\mathsf {W[1]}\)-hard when parameterized by the size of a modulator to diameter at most two graphs and split graphs. In contrast to the above intractability results, we show that Firefighting is fixed parameter tractable (\(\mathsf {FPT}\)) when parameterized by the size of a modulator to threshold graphs and disjoint unions of stars, which are subclasses of diameter at most two graphs. We further investigate the kernelization complexity of these problems to find that Firefighting admits a polynomial kernel when parameterized by the size of a modulator to a clique, while it is unlikely to admit a polynomial kernel when parameterized by the size of a modulator to a disjoint union of stars.
M. K. Enduri—Supported by Tata Consultancy Services (TCS) research fellowship.
N. Misra—Supported by a DST-INSPIRE Fellowship.
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
References
Bazgan, C., Chopin, M., Cygan, M., Fellows, M.R., Fomin, F.V., van Leeuwen, E.J.: Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7), 1285–1297 (2014)
Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171–176 (1996)
Cai, L., Verbin, E., Yang, L.: Firefighting on trees: (1–1/e)–approximation, fixed parameter tractability and a subexponential algorithm. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 258–269. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92182-0_25
Chalermsook, P., Chuzhoy, J.: Resource minimization for fire containment. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1334–1349. Society for Industrial and Applied Mathematics (2010)
Chlebíková, J., Chopin, M.: The firefighter problem: further steps in understanding its complexity. Theoret. Comput. Sci. 676, 42–51 (2017)
Cygan, M., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Das, B., Enduri, M.K., Misra, N., Reddy, I.V.: On structural parameterizations of firefighting. arXiv preprint arXiv:1711.10227 (2017)
Downey, R.G., Fellows, M.R.: Parameterized Complexity, vol. 3. Springer, Heidelberg (1999). https://doi.org/10.1007/978-1-4612-0515-9
Finbow, S., Hartnell, B., Li, Q., Schmeisser, K.: On minimizing the effects of fire or a virus on a network. J. Comb. Math. Comb. Comput. 33, 311–322 (2000)
Finbow, S., King, A., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discrete Math. 307(16), 2094–2105 (2007)
Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Australas. J. Comb. 43, 57–77 (2009)
Foldes, S., Hammer, P.L.: Split graphs. Universität Bonn, Institut für Ökonometrie und Operations Research (1976)
Fomin, F.V., Heggernes, P., van Leeuwen, E.J.: The firefighter problem on graph classes. Theoret. Comput. Sci. 613, 38–50 (2016)
Ganian, R.: Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci. 17(2), 77–100 (2015)
Hartnell, B.: Firefighter! An application of domination. In: 25th Manitoba Conference on Combinatorial Mathematics and Computing (1995)
King, A., MacGillivray, G.: The firefighter problem for cubic graphs. Discrete Math. 310(3), 614–621 (2010)
Leung, M.L.: Fixed parameter tractable algorithm for firefighting problem. arXiv preprint arXiv:1104.1044 (2011)
MacGillivray, G., Wang, P.: On the firefighter problem. J. Comb. Math. Comb. Comput. 47, 83–96 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Das, B., Enduri, M.K., Misra, N., Reddy, I.V. (2018). On Structural Parameterizations of Firefighting. In: Panda, B., Goswami, P. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2018. Lecture Notes in Computer Science(), vol 10743. Springer, Cham. https://doi.org/10.1007/978-3-319-74180-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-74180-2_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74179-6
Online ISBN: 978-3-319-74180-2
eBook Packages: Computer ScienceComputer Science (R0)