Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Klein, R., Kübel, D., Langetepe, E., Sack, J. R., & Schwarzwald, B. (2020). A New Model in Firefighting Theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12016 LNCS, pp. 371–383). Springer. https://doi.org/10.1007/978-3-030-39219-2_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
