The firefighter problem: empirical results on random graphs
DOI10.1016/J.COR.2015.02.004zbMATH Open1348.05190OpenAlexW1984407874MaRDI QIDQ337557FDOQ337557
Authors: C. García-Martínez, Christian Blum, F. J. Rodriguez, M. Lozano 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.004
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Random graphs (graph-theoretic aspects) (05C80) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- 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
- The firefighter problem with more than one firefighter on trees
- A lower bound of the surviving rate of a planar graph with girth at least seven
- The firefighter problem for graphs of maximum degree three
- More fires and more fighters
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- The surviving rate of a graph for the firefighter problem
- The Firefighter problem: a survey of results, directions and questions
- Approximations of the critical region of the fbietkan statistic
- Fire Containment in Planar Graphs
- The surviving rate of an infected network
- The 2-surviving rate of planar graphs without 4-cycles
- The surviving rate of planar graphs
- The firefighter problem for cubic graphs
- The surviving rate of an outerplanar graph for the firefighter problem
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Title not available (Why is that?)
- 3/2 firefighters are not enough
- Multi-start methods for combinatorial optimization
- Approximability of the firefighter problem. Computing cuts over time
- Fire containment in grids of dimension three and higher
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- Parameterized Complexity of Firefighting Revisited
- Title not available (Why is that?)
- Approximation algorithms for the firefighter problem: cuts over time and submodularity
- Fighting constrained fires in graphs
- Title not available (Why is that?)
- Firefighting on square, hexagonal, and triangular grids
- Firefighting on the triangular grid
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
Cited In (14)
- 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
- A new model and algorithms in firefighting theory
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)
