A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A preliminary version of this work was presented at the 11th Workshop on Algorithms and Models for the Web Graph (WAW '14), ... Most research on the problem considers the case in which the fire starts in a single place (i.e., f = 1), and in which the budget of available firefighters per time-step is one (i.e., b = 1). ... A linear programming relaxation for trees that supposedly gives a capproximation algorithm was presented in 2006  , and a subexponential (1 − 1/e)approximation method in 2008  . ...doi:10.1080/15427951.2015.1110542 fatcat:tqygmwr4zfarfjipj6wvbgrgoq