@inbook{b797dc27df944380b67c176670a6ccef,
title = "Online Matching On a Line",
abstract = "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”.",
keywords = "IR-75418, Competitive Analysis, Matching, On-line algorithms",
author = "Bernard Fuchs and Winfried Hochst{\"a}ttler and Walter Kern",
year = "2003",
doi = "10.1016/S1571-0653(04)00436-6",
language = "Undefined",
series = "Electronic Notes in Theoretical Computer Science (ENTCS)",
publisher = "Elsevier",
pages = "49--51",
editor = "Broersma, {Haitze J.} and U. Faigle and Hurink, {Johann L.} and Stefan Pickl and Gerhard Woeginger",
booktitle = "2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization",
note = "2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003 ; Conference date: 14-05-2003 Through 16-05-2003",
}