# A randomized algorithm for the on-line weighted bipartite matching problem - Computer Science > Data Structures and Algorithms

A randomized algorithm for the on-line weighted bipartite matching problem - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: We study the on-line minimum weighted bipartite matching problem in arbitrarymetric spaces. Here, $n$ not necessary disjoint points of a metric space $M$are given, and are to be matched on-line with $n$ points of $M$ revealed one byone. The cost of a matching is the sum of the distances of the matched points,and the goal is to find or approximate its minimum. The competitive ratio ofthe deterministic problem is known to be $\Theta(n)$. It was conjectured that arandomized algorithm may perform better against an oblivious adversary, namelywith an expected competitive ratio $\Theta(\log n)$. We prove a slightly weakerresult by showing a $o(\log^3 n)$ upper bound on the expected competitiveratio. As an application the same upper bound holds for the notoriously hardfire station problem, where $M$ is the real line.

Author: ** Béla Csaba (Anal. and Stoch. Res. Group, HAS), András S. Pluhár (Dept. of Comp. Sci., Univ. of Szeged)**

Source: https://arxiv.org/