Firefighting on trees
From MaRDI portal
Publication:2328866
DOI10.1016/j.tcs.2019.01.040zbMath1434.91019MaRDI QIDQ2328866
Marc Demange, Bertrand Jouve, Pierre Coupechoux, David Ellison
Publication date: 16 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.040
91A50: Discrete-time games
91A43: Games involving graphs
05C57: Games on graphs (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fighting constrained fires in graphs
- The coarse geometry of Hartnell's firefighter problem on infinite graphs
- The firefighter problem: further steps in understanding its complexity
- The firefighter problem on graph classes
- Online algorithms: a survey
- 3/2 firefighters are not enough
- The firefighter problem with more than one firefighter on trees
- The firefighter problem for graphs of maximum degree three
- Approximability of the firefighter problem. Computing cuts over time
- Parameterized complexity of firefighting
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Firefighting on Trees Beyond Integrality Gaps
- Firefighting on trees and Cayley graphs