Florian Berger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Florian Berger has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Rolf Klein
Institute of Computer Science, University of Bonn, 53117 Bonn, Germany
2 shared publications - Alexander Gilbers
Institute of Computer Science University of Bonn 53113 Bonn Germany
1 shared publication - Ansgar Grüne
Department of Computer Science I University of Bonn Germany
1 shared publication - Doron Nussbaum
Carleton University
1 shared publication - Jiehua Yi
School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6
1 shared publication - Jörg-Rüdiger Sack
School of Computer Science, Carleton University, Ottawa, Canada
1 shared publication
Latest Publications
- Open Access
- 7 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1069-1086
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 et al. [5] showed that n/2 lions are not enough to clear the n x n-grid. In this paper, we consider the same problem in dimension d > 2 and prove that Θ(nd-1/√d) lions are necessary and sufficient to clear the nd-grid. Furthermore, we analyze a problem variant where the lions are also allowed to jump from grid vertices to non-adjacent grid vertices.
- 7 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1069-1086
Open AccessHow 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 et al. [5] showed that n/2 lions are not enough to clear the n x n-grid. In this paper, we consider the same problem in dimension d > 2 and prove that Θ(nd-1/√d) lions are necessary and sufficient to clear the nd-grid. Furthermore, we analyze a problem variant where the lions are also allowed to jump from grid vertices to non-adjacent grid vertices.
- 16 July 2008
- Published by Springer Nature in GeoInformatica
- Vol. 13 (4) , 453-481
A meeting scheduling problem respecting time and space
- 16 July 2008
- Published by Springer Nature in GeoInformatica
- Vol. 13 (4) , 453-481
A meeting scheduling problem respecting time and space