On the two-dimensional cow search problem

Authors:
Artur Jeż;Jakub Łopuszański
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 2

Shortest paths without a map

Theoretical Computer Science
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem

Information and Computation
Online computation and competitive analysis

Online computation and competitive analysis
Competitive Algorithms for Layered Graph Traversal

SIAM Journal on Computing
A princess swimming in the fog looking for a monster cow

ACM SIGACT News

Searching for an axis-parallel shoreline

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Searching for an axis-parallel shoreline

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate the problem introduced by Baeza-Yates et al. [R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins, Searching with uncertainty, Research report, University of Waterloo, 1987]: given a plane and a horizontal or a vertical line in unknown location give a strategy to find this line. We use a competitive analysis to measure the performance of this strategy. This problem is one of the first generalisations of the cow search problem.