Slash and burn on graphs -- firefighting with general weights
DOI10.1016/J.DAM.2014.11.019zbMATH Open1339.05253OpenAlexW2034861123MaRDI QIDQ299037FDOQ299037
Authors: Vítor Costa, Simone Dantas, Mitre C. Dourado, Dieter Rautenbach, Lucia Draque Penso
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.019
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- The firefighter problem with more than one firefighter on trees
- 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
- Firefighting on trees: How bad is the greedy algorithm?
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Slash and burn on graphs -- firefighting with general weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299037)