How Many Lions Are Needed to Clear a Grid?
We consider a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination spreads one step per time unit in each direction not blocked by a lion. A vertex is cleared from its contamination whenever a lion moves to it. Brass e...
Main Authors: | Rolf Klein, Ansgar Grüne, Alexander Gilbers, Florian Berger |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2009-09-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/2/3/1069/ |
Similar Items
-
Bonnesen-style symmetric mixed inequalities
by: Pengfu Wang, et al.
Published: (2016-09-01) -
An Ecological and Neural Argument for Developing Pursuit-Based Cognitive Enrichment for Sea Lions in Human Care
by: Peter F. Cook, et al.
Published: (2024-03-01) -
An introduction to the Heisenberg Group and the sub-Riemannian isoperimetric problem [electronic resources]: /
by: Capogna, Luca, 1966-, et al.
Published: (2007) -
Weighted quantitative isoperimetric inequalities in the Grushin space R h + 1 ${R}^{h+1}$ with density | x | p $|x|^{p}$
by: Guoqing He, et al.
Published: (2017-07-01) -
Laguerre BV spaces, Laguerre perimeter and their applications
by: He Wang, et al.
Published: (2023-05-01)