Firefighting on trees: How bad is the greedy algorithm?
From MaRDI portal
Recommendations
Cited in
(28)- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Approximability of the firefighter problem. Computing cuts over time
- Surviving rate of graphs and firefighter problem
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- Firefighting on trees
- Maximizing vertex rescue: investigating the firefighter problem with edge subdivision
- The surviving rate of an infected network
- Slash and burn on graphs -- firefighting with general weights
- The surviving rate of an outerplanar graph for the firefighter problem
- The firefighter problem for cubic graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Asymptotic surviving rate of trees with multiple fire sources
- Firefighting as a strategic game
- Online firefighting on trees
- The Firefighter Problem: A Structural Analysis
- scientific article; zbMATH DE number 1506515 (Why is no real title available?)
- The firefighter problem with more than one firefighter on trees
- The firefighter problem on graph classes
- Fighting constrained fires in graphs
- Firefighting on square, hexagonal, and triangular grids
- Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment
- Firefighting on trees and infinite grids
- A matheuristic for the firefighter problem on graphs
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- Multi-layered planar firefighting
- The firefighter problem for graphs of maximum degree three
- More fires and more fighters
- The firefighter problem: further steps in understanding its complexity
This page was built for publication: Firefighting on trees: How bad is the greedy algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716536)
