Back to University of Twente portal
Online matching on a line
Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online matching on a line. [Report]
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 144Kb |
| Abstract: | We prove a lower bound ρ ≥ 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".
|
| Item Type: | Report |
| Copyright: | © 2003 Department of Applied Mathematics, University of Twente |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/65860 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page
Metis ID: 213733