Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334505 | Theoretical Computer Science | 2009 | 15 Pages |
Abstract
We present the Manhattan-Hopper and the Hopper strategy which improve the performance of all known solutions to this problem significantly. They are the first such strategies that are optimal in this setting, i.e., that allow the explorer to move with constant speed, independent of the length of the chain, and keep this length minimum up to a constant factor.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
JarosÅaw KutyÅowski, Friedhelm Meyer auf der Heide,