Abstract
The classical firefighter problem, introduced by Bert Hartnell in 1995, is a deterministic discrete-time model of the spread and defence of fire, rumor, or disease. In contrast to the generally “discontinuous” firefighter movements of the classical setting, we propose in the paper the continuous firefighting model. Given an undirected graph G, at time 0, all vertices of G are undefended, and fires break out on one or multiple different vertices of G. At each subsequent time step, the fire spreads from each burning vertex to all of its undefended neighbors. A finite number of firefighters are available to be assigned on some vertices of G at time 1, and each firefighter can only move from his current location (vertex) to one of his neighbors or stay still at each time step. A vertex is defended if some firefighter reaches it no later than the fire. We study fire containment on infinite k-dimensional square grids under the continuous firefighting model. We show that the minimum number of firefighters needed is exactly 2k for single fire, and 5 for multiple fires when \(k=2\).
Research supported in part by NNSF of China under Grant No. 11601022 and 11531014
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anshelevich, E., Chakrabarty, D., Hate, A., Swamy, C.: Approximation algorithms for the firefighter problem: cuts over time and submodularity. In: Proceedings of the 20th International Symposium on Algorithms and Computation, pp. 974–983 (2009)
Cai, L., Verbin, E., Yang, L.: Firefighting on trees: \((1-1/e)\)-approximation, fixed parameter tractability and a subexponential algorithm. In: Proceedings of the 19th International Symposium on Algorithms and Computation, pp. 258–269 (2008)
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 (2010)
Comellas, F., Mitjana, M., Peters, J.G.: Epidemics in small world communication networks. Technical report, SFU-CMPT-TR-2002 (2002)
Develin, M., Hartke, S.G.: Fire containment in grids of dimension three and higher. Discrete Appl. Math. 155(17), 2257–2268 (2007)
Dezső, Z., Barabási, A.L.: Halting viruses in scale-free networks. Phys. Rev. E 65(5), 055103 (2002)
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)
Fogarty, P.: Catching the fire on grids. Master’s thesis, The University of Vermont (2003)
Hartnell, B.: Firefighter! an application of domination. presentation. In: 25th Manitoba Conference on Combinatorial Mathematics and Computing, University of Manitoba in Winnipeg, Canada (1995)
King, A., MacGillivray, G.: The firefighter problem for cubic graphs. Discrete Math. 310(3), 614–621 (2010)
MacGillivray, G., Wang, P.: On the firefighter problem. J. Comb. Math. Comb. Comput. 47, 83–96 (2003)
Messinger, M.E.: Firefighting on infinite grids. Master’s thesis, Department of Mathematics and Statistics, Dalhousie University (2005)
Messinger, M.E.: Average firefighting on infinite grids. Australas. J. Comb. 41, 15 (2008)
Ng, K., Raff, P.: Fractional firefighting in the two dimensional grid, pp. 2005–23. Technical report, DIMACS (2005)
Scott, A.E., Stege, U., Zeh, N.: Politicians firefighting. In: Proceedings of the 17th International Symposium on Algorithms and Computation, pp. 608–617 (2006)
Wang, P., Moeller, S.A.: Fire control on graphs. J. Comb. Math. Comb. Comput. 41, 19–34 (2002)
Yutaka, I., Naoyuki, K., Tomomi, M.: Improved approximation algorithms for firefighter problem on trees. IEICE Trans. Inf. Syst. 94(2), 196–199 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chen, X., Hu, X., Wang, C., Zhang, Y. (2017). Continuous Firefighting on Infinite Square Grids. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-55911-7_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55910-0
Online ISBN: 978-3-319-55911-7
eBook Packages: Computer ScienceComputer Science (R0)