A new model and algorithms in firefighting theory

Continuous and discrete models as well as algorithms Bressan (2007) and Finbow and MacGillivray (2009) for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a graph to study firefighting problems in various terra...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 319; s. 296 - 309
Hlavní autori: Klein, Rolf, Kübel, David, Langetepe, Elmar, Sack, Jörg-Rüdiger, Schwarzwald, Barbara
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 15.10.2022
Predmet:
Algorithmic complexity
Combinatorial algorithms
Discrete geometry
Firefighting
Frontal propagation
Graph algorithms
Algorithmic complexity
Discrete geometry
Combinatorial algorithms
Frontal propagation
Graph algorithms
Firefighting
ISSN:0166-218X, 1872-6771
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Continuous and discrete models as well as algorithms Bressan (2007) and Finbow and MacGillivray (2009) for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a graph to study firefighting problems in various terrains. In the context of this model, we present two different firefighting problems called village protection problems, where the goal is to protect a specific set of locations and provide efficient polynomial time algorithms for their solutions. We also discuss extensions of the model.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2021.12.005