More fires and more fighters
From MaRDI portal
Publication:2444533
Recommendations
Cites work
- scientific article; zbMATH DE number 2061798 (Why is no real title available?)
- 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 trees: How bad is the greedy algorithm?
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- The Firefighter problem: a survey of results, directions and questions
- The firefighter problem for graphs of maximum degree three
- The firefighter problem with more than one firefighter on trees
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The surviving rate of a graph for the firefighter problem
Cited in
(16)- Surviving rate of graphs and firefighter problem
- Firefighting as a game
- The 2-surviving rate of planar graphs without 5-cycles
- Solving the geometric firefighter routing problem via integer programming
- Planar graphs without chordal 5-cycles are 2-good
- Finding exact solutions for the geometric firefighter problem in practice
- New integrality gap results for the firefighters problem on trees
- Slash and burn on graphs -- firefighting with general weights
- Asymptotic surviving rate of trees with multiple fire sources
- Firefighting as a strategic game
- Online firefighting on trees
- Estimation of distribution algorithms for the firefighter problem
- The Firefighter Problem: A Structural Analysis
- The firefighter problem: empirical results on random graphs
- The burning of the snark
- The firefighter problem: further steps in understanding its complexity
This page was built for publication: More fires and more fighters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444533)