On traversing layered graphs on-line

The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained. ?A deterministic algorithm with a competitive ratio of (2). This ratio is close to the lower bound of ?(2) and improves upon the previous best upper bound of (9).?The first known polynomially competitive randomized algorithm with a competitive ratio of (). This settles a conjecture due to Fiat . (A. Fiat, D. P. Foster, H. Karloff, V. Rabani, Y. Ravid, and S. Vishwanathan, "Proceedings 32nd Annual Symposium on Foundations of Computer Science, Sept. 1991).?A lower bound of ?()/(log)) on the competitive ratio of any randomized algorithm for this problem, where ? is any positive number. The previous best lower bound was linear.

[1]  Yossi Azar,et al.  On-line choice of on-line algorithms , 1993, SODA '93.

[2]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[3]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[4]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[5]  Yuval Rabani,et al.  Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[7]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[8]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[9]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[10]  Nathan Linial,et al.  On convex body chasing , 1993, Discret. Comput. Geom..