Results 111 to 120 of about 1,231 (135)

The firefighter problem: Empirical results on random graphs

Computers and Operations Research, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARLOS Garcia-Martinez, Christian Blum, FRANCISCO J Rodríguez   +2 more
exaly   +2 more sources

Approximability of the Firefighter Problem

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate   +2 more
exaly   +3 more sources

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem [PDF]

SIAM Journal on Discrete Mathematics, 2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as possible.
Leizhen Cai
exaly   +2 more sources

Prevalence and implications of gambling problems among firefighters

Addictive Behaviors, 2020
Firefighting is a high-risk occupation that accounts for vulnerability to a range of mental health problems and addictive behaviours. However, no research has addressed whether this vulnerability extends to gambling problems, and the aim of this study was thus to provide new data on frequency and implications of such problems in this occupational ...
Cowlishaw, S., Little, J., Sbisa, A., McFarlane, A.C., Van Hooff, M., Lawrence-Wood, E., O'Donnell, M., Hinton, M., Sadler, N., Savic, A., Forbes, D., Metcalf, O.   +11 more
openaire   +3 more sources

Firefighter injuries are not just a fireground problem

Work, 2015
BACKGROUND: Linking firefighter injury reporting to general motion patterns may provide insight into potential injury mechanisms and the development of prevention strategies. OBJECTIVE: To characterize the injuries sustained by members of a large Canadian metropolitan fire department over a 5-year span.
D M, Frost, T A C, Beach, I, Crosby, S M, McGill   +3 more
openaire   +2 more sources

Finding exact solutions for the Geometric Firefighter Problem in practice

Computers and Operations Research, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mauricio J O Zambon, Pedro J De Rezende, Cid C De Souza   +2 more
exaly   +3 more sources

The Firefighter problem: Saving sets of vertices on cubic graphs [PDF]

Networks, 2019
AbstractIn the context of the Firefighter problem, a deterministic model of the spread of a fire or virus on a graph, SFIRE is the decision problem that asks if a specified set of vertices can be prevented from burning. We show SFIRE remains NP‐complete even when restricted to graphs with maximum degree 3 even when the fire starts at a vertex of degree
Christopher Duffy, Gary Macgillivray
exaly   +3 more sources

Parameterized Complexity of the Firefighter Problem

2011
In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Savingk-Vertices and its dual Saving All Butk-Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable.
Cristina Bazgan, Morgan Chopin, Michael R. Fellows   +2 more
openaire   +1 more source

Simulation-based crossover for the firefighter problem

Proceedings of the Genetic and Evolutionary Computation Conference, 2017
The Firefighter Problem (FFP) is a combinatorial optimization problem in which the goal is to find the best way of protecting nodes in a graph from spreading fire or other threat given limited resources. Because of high computational complexity the FFP is often solved using metaheuristic methods such as evolutionary algorithms (EAs).
openaire   +1 more source

Simheuristics for the Multiobjective Nondeterministic Firefighter Problem in a Time-Constrained Setting [PDF]

Lecture Notes in Computer Science, 2016
The firefighter problem (FFP) is a combinatorial problem requiring the allocation of ‘firefighters’ to nodes in a graph in order to protect the nodes from fire (or other threat) spreading along the edges. In the original formulation the problem is deterministic: fire spreads from burning nodes to adjacent, unprotected nodes with certainty.In this paper
Krzysztof Michalak, Joshua Knowles, Michalak Krzysztof   +2 more
exaly   +3 more sources