Given a set S ⊆ R of points on the line, we consider the task of matching a sequence (r1, r1,... ) of requests in R to points in S. It has been conjectured [Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 268-280] that there exists a 9-competitive online algorithm for this problem, similar to the so-called "cow path" problem [Inform. and Comput. 106 (1993) 234-252]. We disprove this conjecture and show that no online algorithm can achieve a competitive ratio strictly less than 9.001.Our argument is based on a new proof for the optimality of the competitive ratio 9 for the "cow path" problem.
[1]
Christos H. Papadimitriou,et al.
On the k-server conjecture
,
1995,
JACM.
[2]
Ricardo A. Baeza-Yates,et al.
Searching in the Plane
,
1993,
Inf. Comput..
[3]
Allan Borodin,et al.
Online computation and competitive analysis
,
1998
.
[4]
Elias Koutsoupias,et al.
The Online Matching Problem on a Line
,
2003,
WAOA.
[5]
Bala Kalyanasundaram,et al.
On-line Network Optimization Problems
,
1996,
Online Algorithms.
[6]
Mihalis Yannakakis,et al.
Shortest Paths Without a Map
,
1989,
Theor. Comput. Sci..