Towards more efficient infection and fire fighting
From MaRDI portal
Publication:2841981
Recommendations
- Approximation algorithms for the firefighter problem: cuts over time and submodularity
- Approximability of the firefighter problem. Computing cuts over time
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- 3/2 firefighters are not enough
- The firefighter problem: empirical results on random graphs
Cites work
Cited in
(12)- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Approximability of the firefighter problem. Computing cuts over time
- Parameterized Complexity of Firefighting Revisited
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Planar graph is on fire
- Parameterized complexity of firefighting
- Firefighting as a strategic game
- scientific article; zbMATH DE number 1506515 (Why is no real title available?)
- On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
- Approximation algorithms for the geometric firefighter and budget fence problems
- Approximation algorithms for the firefighter problem: cuts over time and submodularity
- Approximations of the generalized cascade model
This page was built for publication: Towards more efficient infection and fire fighting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841981)