Amortized efficiency of list update and paging rules
Communications of the ACM
Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Lower bounds in on-line geometric searching
Computational Geometry: Theory and Applications
The ultimate strategy to search on m rays?
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
A lower bound for randomized searching on m rays
Computer Science in Perspective
Searching on m Bounded Rays Optimally
Searching on m Bounded Rays Optimally
On-line target searching in bounded and unbounded domains
On-line target searching in bounded and unbounded domains
Theoretical Computer Science
Four point conditions and exponential neighborhoods for symmetric TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Evolutionary synthesis of collective behavior
CollSec'10 Proceedings of the 2010 international conference on Collaborative methods for security and privacy
Searching for an axis-parallel shoreline
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Searching for an axis-parallel shoreline
Theoretical Computer Science
| Hi-index | 0.00 |
Searching for a point in the plane is a well-known search game problem introduced in the early eighties. The best known search strategy is given by a spiral and achieves a competitive ratio of 17.289 ... It was shown by Gal [14] that this strategy is the best strategy among all monotone and periodic strategies. Since then it was unknown whether the given strategy is optimal in general. This paper settles this old open fundamental search problem and shows that spiral search is indeed optimal. The given problem can be considered as the continuous version of the well-known m-ray search problem and also appears in several non-geometric applications and modifications. Therefore the optimality of spiral search is an important question considered by many researchers in the last decades. We answer the logarithmic spiral conjecture for the given problem. The lower bound construction might be helpful for similar settings, it also simplifies existing proofs on classical m-ray search.