Title of article :
Online Matching On a Line
Author/Authors :
Fuchs، نويسنده , , Bernhard and Hochstنttler، نويسنده , , Winfried and Kern، نويسنده , , Walter، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
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
Journal title :
Electronic Notes in Discrete Mathematics
