Politician’s Firefighting

DOI10.1007/11940128_61MaRDI QIDQ5459155zbMATH OpenOpenAlexFDO

Authors Allan Scott, Ulrike Stege, Norbert Zeh

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_61

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• The firefighter problem on graph classes
• Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
• Parameterized Complexity of Firefighting Revisited
• Parameterized complexity of firefighting

Cited in

(10)

• A new model and algorithms in firefighting theory
• Surviving rate of graphs and firefighter problem
• Firefighting as a game
• A graph theoretical approach to the firebreak locating problem
• The surviving rate of an infected network
• Continuous firefighting on infinite square grids
• Firefighting as a strategic game
• Estimation of distribution algorithms for the firefighter problem
• The firefighter problem with more than one firefighter on trees
• A matheuristic for the firefighter problem on graphs

This page was built for publication: Politician’s Firefighting

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