OBJECTIVE Firefighter physical aptitude tests were administered to unskilled subjects and operational firefighters to evaluate the impact that testing bias associated with gender, age, activity-specific skills, or task familiarity may have upon establishing performance thresholds. METHODS These tests were administered in sequence, simulating hazmat incidents, ventilation fan carriage (stairs)...

International Journal of Exercise Science 8(4): 341-357, 2015. In an effort to reduce the rates of firefighter fatality, injury, and workplace stress, there has been a call for research to advance knowledge of firefighting performance and injury prevention. Physical and psychological variables important to firefighter health and performance have been identified, yet the interrelated nature of t...

We consider a dynamic problem introduced by B. Hartnell in 1995 [4]. Let (G, r) be a connected rooted graph (where r ∈ V (G)). At time 0, a fire breaks out at r. At each subsequent time interval, the firefighter defends some vertex which is not on fire, and then the fire spreads to all undefended neighbours of each burning (i.e., on fire) vertex. Once defended, a vertex remains so for all time ...

In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of [8]. More precisely, when b ≥ 2 firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree b+2 and polynomial-time solvable for trees of maximum degree b + 2 when...

The following firefighter problem on a finite graph G = (V,E) was introduced by Hartnell at the conference in 1995 [3]. Suppose that a fire breaks out at a given vertex v ∈ V . In each subsequent time unit, a firefighter protects one vertex which is not yet on fire, and then fire spreads to all unprotected neighbours of the vertices on fire. (Once a vertex is on fire or gets protected it stays ...

We consider the following firefighter problem on a graph G = (V, E). Initially, a fire breaks out at a vertex v of G. In each subsequent time unit, a firefighter protects one vertex, 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. Let sn(v) denote the maximum number of vertices the firefigh...

In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k-Vertices and its dual Saving All But k-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. For instance, Saving kVertices is fixed-parameter tractable on planar graphs for parame...