Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
Motivated by issues in allocating limited preventative resources to protect a landscape against the spread of a wildfire from a stochastic ignition point, we give approximation algorithms for a new family of stochastic optimization problems.
KeywordsApproximation Algorithm Edge Cost Fuel Treatment Ignition Point Stage Variable
Unable to display preview. Download preview PDF.
- 5.Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: 40th STOC, pp. 255–264 (2008)Google Scholar
- 6.Shmoys, D., Spencer, G.: Full paper: Approximation algorithms for fragmenting a graph against a stochastically-located threat, http://people.orie.cornell.edu/gms39/images/documents/gsfragment.pdf