The firefighter problem: empirical results on random graphs
From MaRDI portal
(Redirected from Publication:337557)
Recommendations
- The Firefighter problem: a survey of results, directions and questions
- Surviving rate of graphs and firefighter problem
- Surviving rate of graphs and firefighter problem
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- The firefighter problem on graph classes
Cites work
- scientific article; zbMATH DE number 1802810 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 2061798 (Why is no real title available?)
- scientific article; zbMATH DE number 1506515 (Why is no real title available?)
- 3/2 firefighters are not enough
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- A lower bound of the surviving rate of a planar graph with girth at least seven
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Approximability of the firefighter problem. Computing cuts over time
- Approximation algorithms for the firefighter problem: cuts over time and submodularity
- Approximations of the critical region of the fbietkan statistic
- Fighting constrained fires in graphs
- Fire Containment in Planar Graphs
- Fire containment in grids of dimension three and higher
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Firefighting on square, hexagonal, and triangular grids
- Firefighting on the triangular grid
- Geometric algorithms and combinatorial optimization
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- More fires and more fighters
- Multi-start methods for combinatorial optimization
- Parameterized Complexity of Firefighting Revisited
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- The 2-surviving rate of planar graphs without 4-cycles
- The Firefighter problem: a survey of results, directions and questions
- The firefighter problem for cubic graphs
- The firefighter problem for graphs of maximum degree three
- The firefighter problem with more than one firefighter on trees
- The surviving rate of a graph for the firefighter problem
- The surviving rate of an infected network
- The surviving rate of an outerplanar graph for the firefighter problem
- The surviving rate of planar graphs
Cited in
(14)- A new model and algorithms in firefighting theory
- The wildfire suppression problem with multiple types of resources
- Firefighting as a game
- The maximum clique interdiction problem
- Solving the geometric firefighter routing problem via integer programming
- Finding exact solutions for the geometric firefighter problem in practice
- A graph theoretical approach to the firebreak locating problem
- Towards more efficient infection and fire fighting
- Firefighting as a strategic game
- The firefighter problem with subdividing edges on graphs of maximum degree three
- The Firefighter problem: a survey of results, directions and questions
- Estimation of distribution algorithms for the firefighter problem
- A matheuristic for the firefighter problem on graphs
- Approximation algorithms for the firefighter problem: cuts over time and submodularity
This page was built for publication: The firefighter problem: empirical results on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337557)
