A New Model in Firefighting Theory
Computational Geometry
2019-11-26 v1
Abstract
Continuous and discrete models 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.
Cite
@article{arxiv.1911.10341,
title = {A New Model in Firefighting Theory},
author = {Rolf Klein and David Kübel and Elmar Langetepe and Jörg-Rüdiger Sack and Barbara Schwarzwald},
journal= {arXiv preprint arXiv:1911.10341},
year = {2019}
}
Comments
25 pages, 13 figures, pre-print of an article presented at CALDAM 2020