Parameterized complexity of the firefighter problem

DOI10.1007/978-3-642-25591-5_66MaRDI QIDQ3104666zbMATHOpenAlexWikidataFDO

Authors Morgan Chopin, Michael R. Fellows, Cristina Bazgan

Publication date 16 December 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-25591-5_66

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Parameterized Complexity of Firefighting Revisited
• Parameterized complexity of firefighting
• The firefighter problem: further steps in understanding its complexity

Cited in

(6)

• A matheuristic for the firefighter problem on graphs
• Parameterized complexity of firefighting
• The firefighter problem on graph classes
• The Firefighter Problem: A Structural Analysis
• Parameterized Complexity of Firefighting Revisited
• The firefighter problem: further steps in understanding its complexity

This page was built for publication: Parameterized complexity of the firefighter problem

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