New Integrality Gap Results for the Firefighters Problem on Trees

  • Parinya Chalermsook
  • Daniel VazEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10138)


In the firefighter problem on trees, we are given a tree \(G=(V,E)\) together with a vertex \(s \in V\) where the fire starts spreading. At each time step, the firefighters can pick one vertex while the fire spreads from burning vertices to all their neighbors that have not been picked. The process stops when the fire can no longer spread. The objective is to find a strategy that maximizes the total number of vertices that do not burn. This is a simple mathematical model, introduced in 1995, that abstracts the spreading nature of, for instance, fire, viruses, and ideas. The firefighter problem is NP-hard and admits a \((1-1/e)\) approximation via LP rounding. Recently, a PTAS was announced in [1].(The \((1-1/e)\) approximation remained the best until very recently when Adjiashvili et al. [1] showed a PTAS. Their PTAS does not bound the LP gap.)

The goal of this paper is to develop better understanding on the power of LP relaxations for the firefighter problem. We first show a matching lower bound of \((1-1/e+\epsilon )\) on the integrality gap of the canonical LP. This result relies on a powerful combinatorial gadget that can be used to derive integrality gap results in other related settings. Next, we consider the canonical LP augmented with simple additional constraints (as suggested by Hartke). We provide several evidences that these constraints improve the integrality gap of the canonical LP: (i) Extreme points of the new LP are integral for some known tractable instances and (ii) A natural family of instances that are bad for the canonical LP admits an improved approximation algorithm via the new LP. We conclude by presenting a 5 / 6 integrality gap instance for the new LP.


Approximation Algorithm Extreme Point Polynomial Time Approximation Scheme Input Tree Special Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Adjiashvili, D., Baggio, A., Zenklusen, R.: Firefighting on Trees Beyond Integrality Gaps. ArXiv e-prints, January 2016Google Scholar
  2. 2.
    Anshelevich, E., Chakrabarty, D., Hate, A., Swamy, C.: Approximability of the firefighter problem - computing cuts over time. Algorithmica 62(1–2), 520–536 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bazgan, C., Chopin, M., Cygan, M., Fellows, M.R., Fomin, F.V., van Leeuwen, E.J.: Parameterized complexity of firefighting. JCSS 80(7), 1285–1297 (2014)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Bazgan, C., Chopin, M., Ries, B.: The firefighter problem with more than one firefighter on trees. Discrete Appl. Math. 161(7–8), 899–908 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Cai, L., Verbin, E., Yang, L.: Firefighting on trees: (1–1/e)-approximation, fixed parameter tractability and a subexponential algorithm. In: ISAAC (2008)Google Scholar
  6. 6.
    Chalermsook, P., Chuzhoy, J.: Resource minimization for fire containment. In: SODA (2010)Google Scholar
  7. 7.
    Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX/RANDOM -2004. LNCS, vol. 3122, pp. 72–83. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-27821-4_7 CrossRefGoogle Scholar
  8. 8.
    Chlebíková, J., Chopin, M.: The firefighter problem: a structural analysis. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 172–183. Springer, Heidelberg (2014). doi: 10.1007/978-3-319-13524-3_15 Google Scholar
  9. 9.
    Costa, V., Dantas, S., Dourado, M.C., Penso, L., Rautenbach, D.: More fires and more fighters. Discrete Appl. Math. 161(16–17), 2410–2419 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Develin, M., Hartke, S.G.: Fire containment in grids of dimension three and higher. Discrete Appl. Math. 155(17), 2257–2268 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Australas. J. Comb. 43, 57–77 (2009)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Hartke, S.G.: Attempting to narrow the integrality gap for the firefighter problem on trees. Discrete Methods Epidemiol. 70, 179–185 (2006)MathSciNetGoogle Scholar
  13. 13.
    Hartnell, B.: Firefighter! an application of domination. In: Manitoba Conference on Combinatorial Mathematics and Computing (1995)Google Scholar
  14. 14.
    Iwaikawa, Y., Kamiyama, N., Matsui, T.: Improved approximation algorithms for firefighter problem on trees. IEICE Trans. 94–D(2), 196–199 (2011)CrossRefGoogle Scholar
  15. 15.
    King, A., MacGillivray, G.: The firefighter problem for cubic graphs. Discrete Math. 310(3), 614–621 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Wang, P., Moeller, S.A.: Fire control on graphs. J. Comb. Math. Comb. Comput. 41, 19–34 (2002)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Aalto UniversityEspooFinland
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany
  3. 3.Graduate School of Computer ScienceSaarland UniversitySaarbrückenGermany

Personalised recommendations