Lower bounds in on-line geometric searching

Computational Geometry: Theory and Applications

Volumn 18, Issue 1, 2001, Pages 37-53

  Schuierer, Sven ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Autonomous mobile robots; Competitive analysis; Computational geometry; Lower bounds; Navigation; On line algorithms

Indexed keywords

EID: 0242542063     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00030-4     Document Type: Article

References (29)

1. Azar Y., Broder A., Manasse M. On-line choice of on-line algorithms. Proc. 4th ACM-SIAM Symposium on Discrete Algorithms. 1993;432-440.
2. Baeza-Yates R., Culberson J., Rawlins G. Searching in the plane. Inform. Comput. 106:1993;234-252.
3. Beck A. On the linear search problem. Israel J. Math. 2:1964;221-228.
4. Beck A. More on the linear search problem. Israel J. Math. 3:1965;61-70.
5. Beck A., Beck M. The son of the linear search problem. Israel J. Math. 48:(2-3):1984;109-122.
6. Beck A., Beck M. The linear search problem rides again. Israel J. Math. 53:(3):1986;365-372.
7. Beck A., Beck M. The revenge of the linear search problem. SIAM J. Control Optim. 30:(1):1992;112-122.
8. Beck A., Newman D. Yet more on the linear search problem. Israel J. Math. 8:1970;419-429.
9. Beck A., Warren P. The return of the linear search problem. Israel J. Math. 10:1972;169-183.
10. * , an optimal search. SIAM Rev. 5:(2):1963;274.
11. Borodin A., Linial N., Saks M. An optimal on-line algorithm for metrical task system. Journal of the ACM. 39:(4):1992;745-763.
12. Eades P., Lin X., Wormald N.C. Performance guarantees for motion planning with temporal uncertainty. The Australian Comput. J. 25:(1):1993;21-28.
13. Franck W. On an optimal search problem. SIAM Rev. 7:1965;503-512.
14. Gal S. A general search game. Israel J. Math. 12:1972;32-45.
15. Gal S. Minimax solutions for linear search problems. SIAM J. Appl. Math. 27:(1):1974;17-30.
16. Gal S. Search Games. 1980;Academic Press, New York.
17. Gal S., Chazan D. On the optimality of the exponential functions for some minimax problems. SIAM J. Appl. Math. 30:(2):1976;324-348.
18. Hammar M., Nilsson B., Schuierer S. Parallel searching on m rays. Meinel Ch., Tison S. Proc. 16th International Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1563:1999;132-142.
19. Hipke Ch., Icking Ch., Klein R., Langetepe E. How to find a point on a line within a fixed distance. Discrete Appl. Math. 93:1999;67-73.
20. Kao M.Y., Ma Y., Sipser M., Yin Y. Optimal constructions of hybrid algorithms. J. Algorithms. 29:1998;142-164.
21. Klein R. Algorithmische Geometrie. 1997;Addison-Wesley, Reading, MA.
22. Koutsoupias E., Papadimitriou Ch., Yannakakis M. Searching a fixed graph. Proc. 23rd Intern. Colloq. on Automata, Languages and Programming. Lecture Notes in Computer Science. 1099:1996;280-289.
23. López-Ortiz A. On-line searching on bounded and unbounded domains. Ph.D. Thesis. 1996;Department of Computer Science, University of Waterloo.
24. López-Ortiz A., Schuierer S. Generalized streets revisited. Serna M., Diaz J. Proc. 4th European Symposium on Algorithms. Lecture Notes in Computer Science. 1136:1996;546-558.
25. López-Ortiz A., Schuierer S. The ultimate strategy to search on m rays? Hsu W.-L., Kao M.-Y. Proc. 4th Intl. Conf. on Computing and Combinatorics. Lecture Notes in Computer Science. 1449:1998;75-84.
26. Papadimitriou C.H., Yannakakis M. Shortest paths without a map. Theor. Comput. Sci. 84:(1):1991;127-150.
27. Rousseeuw P. Optimal search paths for random variables. J. Comput. Appl. Math. 9:1983;279-286.
28. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. of the ACM. 28:1985;202-208.
29. Yin Y. Teaching, Learning, and Exploration. Ph.D. Thesis. 1994;Department of Mathematics and Laboratory for Computer Science, MIT.