A New Model in Firefighting Theory

11/23/2019
by   Rolf Klein, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset