A New Model in Firefighting Theory
- 560 Downloads
Continuous and discrete models [1, 5] for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied terrains. We present three different firefighting problems in the context of this model; for two of which, we provide efficient polynomial time algorithms and for the third, we show NP-completeness. We also discuss possible extensions of the model and their implications on the computational complexity.
KeywordsCellular automaton Combinatorial algorithms Computational complexity Discrete geometry Fire spread models Fire behaviour modeling Firefighting Forest fire simulation Frontal propagation Graph algorithms Graph theory NP-completeness Undecidability
We thank all anonymous reviewers for their helpful comments and suggestions.
- 9.Klein, R., Kübel, D., Langetepe, E., Sack, J.R., Schwarzwald, B.: A new model in firefighting theory. CoRR abs/1911.10341 (2019). https://arxiv.org/abs/1911.10341