Approximation algorithms for fragmenting a graph against a stochastically-located threat

Authors:
David B. Shmoys;Gwen Spencer
Affiliations:
School of ORIE and Dept. of Computer Science, Cornell University, Ithaca, NY;School of ORIE, Cornell University, Ithaca, NY
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 4
Cited 0

Optimal hierarchical decompositions for congestion minimization in networks

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unbalanced graph cuts

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Cut problems in graphs with a budget constraint

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.