Deterministic Min-Cost Matching with Delays

06/10/2018
by   Yossi Azar, et al.
0

We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is given, and requests are submitted in different times in this space by an adversary. The goal is to match requests, while minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched. In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with one of two classes, and requests can only be matched with requests of the other class. Previous algorithms for the problems mentioned above, include randomized O( n)-competitive algorithms for known and finite metric spaces, n being the size of the metric space, and a deterministic O(m)-competitive algorithm, m being the number of requests. We introduce O(m^(3/2+ϵ))-competitive deterministic algorithms for both problems and for any fixed ϵ > 0, m being the number of requests. In particular, for a small enough ϵ the competitive ratio becomes O(m^0.59). These are the first deterministic algorithms for the mentioned online matching problems, achieving a sub-linear competitive ratio. Our algorithms do not need to know the metric space in advance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2018

A Primal-Dual Online Deterministic Algorithm for Matching with Delays

In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m request...
research
11/03/2020

The Min-Cost Matching with Concave Delays Problem

We consider the problem of online min-cost perfect matching with concave...
research
03/07/2022

Online Matching with Convex Delay Costs

We investigate the problem of Min-cost Perfect Matching with Delays (MPM...
research
05/17/2020

The Online Multi-Commodity Facility Location Problem

We consider a natural extension to the metric uncapacitated Facility Loc...
research
09/25/2020

Online Hypergraph Matching with Delays

We study an online hypergraph matching problem with delays, motivated by...
research
09/14/2021

Online k-Way Matching with Delays and the H-Metric

In this paper, we study k-Way Min-cost Perfect Matching with Delays - th...
research
05/02/2023

A Subquadratic Bound for Online Bisection

In the online bisection problem one has to maintain a partition of n ele...

Please sign up or login with your details

Forgot password? Click here to reset