Online matching on a line involves matching an online stream of items of various sizes to stored items of various sizes, with the objective of minimizing the average discrepancy in size between matched items. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number of items, and constant, respectively. We show that online matching on a line is essentially equivalent to a particular search problem, that we call k-lost cows. We then obtain the first deterministic sub-linearly competitive algorithm for online matching on a line by giving such an algorithm for the k-lost cows problem.
|Name||Lecture Notes in Computer Science|
|Name||Theoretical Computer Science and General Issues|
|Conference||12th International Workshop on Approximation and Online Algorithms, WAOA 2014|
|Period||11/09/14 → 12/09/14|