Resource minimization for fire containment

MaRDI QIDQ5417712zbMATH OpenFDO

Authors Parinya Chalermsook, Julia Chuzhoy

Publication date 22 May 2014

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Firefighting on trees beyond integrality gaps
• Firefighting on trees beyond integrality gaps
• Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
• Approximability of the firefighter problem. Computing cuts over time
• New integrality gap results for the firefighters problem on trees

Cited in

(14)

• Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment
• Approximation algorithms for fragmenting a graph against a stochastically-located threat
• Approximability of the firefighter problem. Computing cuts over time
• Approximation algorithms for fragmenting a graph against a stochastically-located threat
• New integrality gap results for the firefighters problem on trees
• Continuous firefighting on infinite square grids
• Seepage in directed acyclic graphs
• Approximation algorithms for the firefighter problem: cuts over time and submodularity
• Firefighting on trees beyond integrality gaps
• Firefighting on trees beyond integrality gaps
• Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment
• Robust \(k\)-center with two types of radii
• Robust \(k\)-center with two types of radii
• The firefighter problem on graph classes

This page was built for publication: Resource minimization for fire containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417712)