Title of article
Online Matching On a Line
Author/Authors
Fuchs، نويسنده , , Bernhard and Hochstنttler، نويسنده , , Winfried and Kern، نويسنده , , Walter، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
3
From page
49
To page
51
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
online algorithms , competitive analysis , Matching
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2003
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453448
Link To Document