TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING

DOI10.1142/S0129054113400017zbMath1269.68068OpenAlexW2202118583MaRDI QIDQ2841981

Mia Persson, Peter Floderus, Andrzej Lingas

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400017

zbMATH Keywords

approximation algorithmssubexponential algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Parameterized Complexity of Firefighting Revisited ⋮ Parameterized complexity of firefighting ⋮ Planar graph is on fire ⋮ Approximation algorithms for the geometric firefighter and budget fence problems ⋮ Firefighting as a Strategic Game

Cites Work

• The budgeted maximum coverage problem
• The firefighter problem for graphs of maximum degree three
• A Separator Theorem for Planar Graphs
• On the Number of Husimi Trees

This page was built for publication: TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING