Slash and burn on graphs -- firefighting with general weights
From MaRDI portal
Publication:299037
DOI10.1016/J.DAM.2014.11.019zbMath1339.05253OpenAlexW2034861123MaRDI QIDQ299037
Dieter Rautenbach, Vitor Costa, Simone Dantas, Mitre C. Dourado, 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
Extremal problems in graph theory (05C35) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Cites Work
- 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
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Slash and burn on graphs -- firefighting with general weights