We study the online matching problem when the metric space is a single straight line. For this case, the offline matching problem is trivial but the online problem has been open and the best known competitive ratio was the trivial Θ(n) where n is the number of requests. It was conjectured that the generalized Work Function Algorithm has constant competitive ratio for this problem. We show that it is in fact Ω(log n) and O(n), and make some progress towards proving a better upper bound by establishing some structural properties of the solutions. Our technique for the upper bound doesn't use a potential function but it reallocates the online cost in a way that the comparison with the offline cost becomes more direct. © Springer-Verlag 2004.
CITATION STYLE
Koutsoupias, E., & Nanavati, A. (2004). The online matching problem on a line. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2909, 179–191. https://doi.org/10.1007/978-3-540-24592-6_14
Mendeley helps you to discover research relevant for your work.