# Online matching on a line

Bernard Fuchs, Winfried Hochstättler, Walter Kern

Research output: Book/ReportReportProfessional

6 Citations (Scopus)

## Abstract

We prove a lower bound $\rho \geq 9.001$ for the 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''.
Original language Undefined Enschede University of Twente 14 0169-2690 Published - 2003

### Publication series

Name Memorandum Afdeling TW Department of Applied Mathematics, University of Twente 1675 0169-2690

• IR-65860
• EWI-3495
• MSC-68Q25
• MSC-68M20
• METIS-213733