An alternative proof for the equivalence of ∞-searcher and 2-searcher
It was conjectured in 1992 that the 2-searcher, who has two flashlights, has the same searching capability as the ∞-searcher, who has an omni-directional light source. Park et al. proved this conjecture affirmatively in 2001, but their proof is rather complicated and not easy to understand. In this...
Saved in:
Published in | Theoretical computer science Vol. 634; pp. 108 - 119 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
27.06.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | It was conjectured in 1992 that the 2-searcher, who has two flashlights, has the same searching capability as the ∞-searcher, who has an omni-directional light source. Park et al. proved this conjecture affirmatively in 2001, but their proof is rather complicated and not easy to understand. In this paper we present an alternative proof, which we believe is conceptually more transparent and easier to understand. For this purpose, we introduce a tool called the 2-link visibility diagram that represents 2-link visibility, which has other applications. |
---|---|
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/j.tcs.2016.04.016 |