Lower bounds in on-line geometric searching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 429-440

  Schuierer, Sven ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPETITIVE RATIO; KNOWN ENVIRONMENTS; LOWER BOUNDS; SEARCH COSTS; SEARCH STRATEGIES; UPPER BOUND;

COMPUTATION THEORY;

EID: 84958757174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036204     Document Type: Conference Paper

References (24)

1. R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106:234-252, 1993.
2. A. Beck. On the linear search problem. Israel Journal of Math., 2:221-228, 1964.
3. A. Beck. More on the linear search problem. Israel Journal of Math., 3:61-70, 1965.
4. A. Beck and D. Newman. Yet more on the linear search problem. Israel Journal of Math., 8:419-429, 1970.
5. A. Beck and P. Warren. The return of the linear search problem. Israel Journal of Math., 10:169-183, 1972.
6. R. Bellman. An optimal search Problem. SIAM Review, 5(2):274, 1963.
7. M. Betke, R. L. Rivest, and M. Singh. Piecemeal learning of an unknown environment. In Sixth ACM Conference on Computational Learning Theory (COLT 93), pages 277-286, July 1993.
8. K.-F. Chan and T. W. Lam. An on-line algorithm for navigating in an unknown environment. International Journal of Computational Geometry & Applications, 3:227-244, 1993.
9. A. Datta, Ch. Hipke, and S. Schuierer. Competitive searching in polygons-beyond generalized streets. In Proc. Sixth Annual International Symposium on Algorithms and Computation, pages 32-41. LNCS 1004, 1995.
10. A. Datta and Ch. Icking. Competitive searching in a generalized street. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 175-182, 1994.
11. S. Gal. A general search game. Israel Journal of Math., 12:32-45, 1972.
12. S. Gal. Minimax solutions for linear search problems. SIAM Journal of Applied Math., 27(1):17-30, 1974.
13. S. Gal. Search Games. Academic Press, 1980.
14. S. Gal and D. Chazan. On the optimality of the exponential functions for some minimax problems. SIAM Journal of Applied Math., 30(2):324-348, 1976.
15. Ch. Hipke. Online-Algorithmen zur kompetitiven Suche in einfachen Polygonen. Master’s thesis, Universität Freiburg, 1994.
16. M.-Y. Kao, Y. Ma, M. Sipser, and Y. Yin. Optimal constructions of hybrid algorithms. In Proc. 5th A CM-SIAM Sympos. Discrete Algorithms, pages 372-381, 1994.
17. M.-Y. Kao, J. H. Reif, and S. R. Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 441-447, 1993.
18. R. Klein. Walking an unknown street with bounded detour. Comput. Geom. Theory Appi, 1:325-351, 1992.
19. J. M. Kleinberg. On-line search in a simple polygon. In Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, pages 8-15, 1994.
20. A. López-Ortiz. On-line Searching on Bounded and Unbounded Domains. PhD thesis, Department of Computer Science, University of Waterloo, 1996.
21. A. López-Ortiz and S. Schuierer. Going home through an unknown street. In S. G. AkI, F. Dehne, and J.-R. Sack, editors, Proc. 4th Workshop on Algorithms and Datastructures, pages 135-146. LNCS 955. 1995.
22. A. López-Ortiz and S. Schuierer. Generalized streets revisited. In to appear, editor, Proc. 4th European Symposium on Algorithms, 1996.
23. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. In Proc. 16th Internat Colloq. Automata Lang. Program., volume 372 of Lecture Notes in Computer Science, pages 610-620. Springer-Verlag, 1989.
24. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.