Lower bounds in on-line geometric searching

  title={Lower bounds in on-line geometric searching},
  author={Sven Schuierer},
  journal={Comput. Geom.},
We present a new technique to prove lower bounds for geometric on-line searching problems. We assume that a target of unknown location is hidden somewhere in a known environment and a searcher is trying to find it. We are interested in lower bounds on the competitive ratioof the search strategy, that is, the ratio of the distance traveled by the searcher to the distance of the target. The technique we present is applicable to a number of problems, such as biased searching on m rays and on-line… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
5 Citations
31 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 31 references

Search Games

  • S. Gal
  • Academic Press, New York
  • 1980
Highly Influential
7 Excerpts

Yet more on the linear search problem

  • A. Beck, D. Newman
  • Israel J. Math. 8
  • 1970
Highly Influential
4 Excerpts

On the linear search problem

  • A. Beck
  • Israel J. Math. 2
  • 1964
Highly Influential
3 Excerpts

Problem 63-9 ∗

  • R. Bellman
  • an optimal search, SIAM Rev. 5 (2)
  • 1963
Highly Influential
1 Excerpt

Algorithmische Geometrie

  • R. Klein
  • Addison-Wesley, Reading, MA
  • 1997


  • E. Koutsoupias
  • Papadimitriou, M. Yannakakis, Searching a fixed…
  • 1996

Similar Papers

Loading similar papers…