A randomized algorithm for the on-line weighted bipartite matching problem

Béla Csaba, András S. Pluhár

We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, $n$ not necessary disjoint points of a metric space $M$ are given, and are to be…