Towards more efficient infection and fire fighting
DOI10.1142/S0129054113400017zbMATH Open1269.68068OpenAlexW2202118583MaRDI QIDQ2841981FDOQ2841981
Authors: Peter Floderus, Mia Persson, Andrzej Lingas 
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113400017
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cites Work
Cited In (11)
- 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
- Title not available (Why is that?)
- 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)
