Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-39219-2_30 | CALDAM |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rolf Klein | 1 | 79 | 9.70 |
| David Kübel | 2 | 0 | 1.69 |
| Elmar Langetepe | 3 | 199 | 25.87 |
| Jörg-Rüdiger Sack | 4 | 5 | 4.27 |
| Barbara Schwarzwald | 5 | 0 | 1.69 |