Online Matching On a Line


Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online Matching On a Line. In: Hajo Broersma & Ulrich Faigle & Johann Hurink & Stefan Pickl & Gerhard Woeginger (Eds.), 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Theoretical Computer Science (ENTCS), 13 . Elsevier, pp. 49-51.

[img] PDF
Restricted to UT campus only

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”.
Item Type:Book Section
Copyright:© 2003 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page