Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity

DOI10.1007/978-3-642-10631-6_98zbMath1273.68405OpenAlexW1508211895MaRDI QIDQ3652284

Chaitanya Swamy, Deeparnab Chakrabarty, Elliot Anshelevich, Ameya Hate

Publication date: 17 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_98

Mathematics Subject Classification ID

Epidemiology (92D30) Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (8)

The firefighter problem: empirical results on random graphs ⋮ On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms ⋮ The firefighter problem on graph classes ⋮ Target set selection in social networks with tiered influence and activation thresholds ⋮ The firefighter problem with more than one firefighter on trees ⋮ Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results ⋮ Continuous Firefighting on Infinite Square Grids ⋮ On efficient vaccine distribution strategy to suppress pandemic using social relation

This page was built for publication: Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity