More fires and more fighters
From MaRDI portal
Publication:2444533
DOI10.1016/j.dam.2013.04.008zbMath1285.05121OpenAlexW2095274987MaRDI QIDQ2444533
Simone Dantas, Vitor Costa, Mitre C. Dourado, Dieter Rautenbach, Lucia Draque Penso
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.008
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (13)
The 2-surviving rate of planar graphs without 5-cycles ⋮ Slash and burn on graphs -- firefighting with general weights ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ The Firefighter Problem: A Structural Analysis ⋮ New Integrality Gap Results for the Firefighters Problem on Trees ⋮ Estimation of Distribution Algorithms for the Firefighter Problem ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ The firefighter problem: further steps in understanding its complexity ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The firefighter problem with more than one firefighter on trees
- The firefighter problem for graphs of maximum degree three
- Fire containment in grids of dimension three and higher
- 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
This page was built for publication: More fires and more fighters
