Fire containment in grids of dimension three and higher

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [1995] and the problem of minimizing the number of burnt vertices when deploying a limited number of firefighters per timestep. We consider the process occurring on the d-dimensional square lattice for d>=3, and we prove several results, including two conjectures of Wang and Moeller [2002].
15 pages, 1 figure

Keywords

Combinatorics, 05C75, 90C35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/72451

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0409195
 http://arxiv.org/abs/math/0409195

Collections

arXiv