Online Matching On a Line

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online Matching On a Line. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Theoretical Computer Science (ENTCS), 13 . Elsevier, pp. 49-51.

PDF
Restricted to UT campus only
76Kb

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
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/75418
Official URL:	http://dx.doi.org/10.1016/S1571-0653(04)00436-6
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page