Online Matching On a Line

We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching problem on a line. As a consequence, the online matching problem is revealed to be strictly more difficult than the “cow problem”.

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

[2]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[3]  Elias Koutsoupias,et al.  The Online Matching Problem on a Line , 2003, WAOA.

[4]  Bala Kalyanasundaram,et al.  On-line Network Optimization Problems , 1996, Online Algorithms.

[5]  Bernhard Fuchs,et al.  Online Matching On a Line , 2003, Electron. Notes Discret. Math..

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

[7]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.