A new model in firefighting theory

From MaRDI portal
Publication:779236

DOI10.1007/978-3-030-39219-2_30zbMATH Open1453.68207arXiv1911.10341OpenAlexW3002346630MaRDI QIDQ779236FDOQ779236

Jörg-Rüdiger Sack, Barbara Schwarzwald, Elmar Langetepe, Rolf Klein, David Kübel

Publication date: 21 July 2020

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.


Full work available at URL: https://arxiv.org/abs/1911.10341




Recommendations





Cited In (4)





This page was built for publication: A new model in firefighting theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779236)