A Deterministic O(log m)-Competitive Algorithm for Online Minimum Cost Bipartite Matching with Delays
In the online Minimum cost Bipartite Perfect Matching with Delays (MBPMD) problem, $m$ requests and $m$ servers arrive over time in a metric space. An online algorithm has to match each request to a server and can postpone a matching decision by paying the delay cost. The objective is to minimize the total distance and...