View in EDS

TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING.

Saved in:
Bibliographic Details
Title: TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING.
Authors: FLODERUS, PETER1 pflo@maths.Ith.se, LINGAS, ANDRZEJ2 Andrzej.Lingas@cs.Ith.se, PERSSON, MIA3 mia.persson@mah.se
Source: International Journal of Foundations of Computer Science. Jan2013, Vol. 24 Issue 1, p3-14. 12p. 3 Diagrams.
Subjects: Algorithms, Firefighting, Computer viruses, Vaccination, Graph theory, Mathematical models, Approximation theory, Computational complexity
Abstract: The firefighter problem models the situation where an infection, a computer virus, an idea or fire etc. is spreading through a network and the goal is to save as many as possible nodes of the network through targeted vaccinations. The number of nodes that can be vaccinated at a single time-step is typically one, or more generally O(l). In a non-standard model, the so called spreading model, the vaccinations also spread in contrast to the standard model. Our main results are concerned with general graphs in the spreading model. We provide a very simple exact 20(√n log n) -time algorithm. In the special case of trees, where the standard and spreading model are equivalent, our algorithm is substan-tially simpler than that exact subexponential algorithm for trees presented in Ref. 2. On the other hand, we show that the firefighter problem on weighted directed graphs in the spreading model cannot be approximated within a constant factor better than 1 -- 1/e unless NP C DTIME (nO(log log n)) We also present several results in the standard model. We provide approximation algorithms for planar graphs in case when at least two vaccinations can be performed at a time-step. We also derive trade-offs between approximation factors for polynomial-time solutions and the time complexity of exact or nearly exact solutions for instances of the firefighter problem for the so called directed layered graphs. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:The firefighter problem models the situation where an infection, a computer virus, an idea or fire etc. is spreading through a network and the goal is to save as many as possible nodes of the network through targeted vaccinations. The number of nodes that can be vaccinated at a single time-step is typically one, or more generally O(l). In a non-standard model, the so called spreading model, the vaccinations also spread in contrast to the standard model. Our main results are concerned with general graphs in the spreading model. We provide a very simple exact 20(√n log n) -time algorithm. In the special case of trees, where the standard and spreading model are equivalent, our algorithm is substan-tially simpler than that exact subexponential algorithm for trees presented in Ref. 2. On the other hand, we show that the firefighter problem on weighted directed graphs in the spreading model cannot be approximated within a constant factor better than 1 -- 1/e unless NP C DTIME (nO(log log n)) We also present several results in the standard model. We provide approximation algorithms for planar graphs in case when at least two vaccinations can be performed at a time-step. We also derive trade-offs between approximation factors for polynomial-time solutions and the time complexity of exact or nearly exact solutions for instances of the firefighter problem for the so called directed layered graphs. [ABSTRACT FROM AUTHOR]
ISSN:01290541
DOI:10.1142/S0129054113400017