Online Bipartite Matching with Reusable Resources

10/13/2021
by   Steven Delong, et al.
0

We study the classic online bipartite matching problem with a twist: offline nodes are reusable any number of times. Every offline node i becomes available d steps after it was assigned to. Nothing better than a 0.5-approximation, obtained by the trivial deterministic greedy algorithm, was known for this problem. We give the first approximation factor beating 0.5, namely a 0.505 approximation, by suitably adapting and interpreting the powerful technique of Online Correlated Selection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2020

Greedy Approaches to Online Stochastic Matching

Within the context of stochastic probing with commitment, we consider th...
research
10/21/2021

Online Bipartite Matching with Predicted Degrees

We propose a model for online graph problems where algorithms are given ...
research
02/16/2021

Online matching in lossless expanders

Bauwens and Zimand [BZ 2019] have shown that lossless expanders have an ...
research
12/14/2021

Secretary Matching With Vertex Arrivals and No Rejections

Most prior work on online matching problems has been with the flexibilit...
research
09/21/2021

Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach

From assigning computing tasks to servers and advertisements to users, s...
research
05/02/2018

Greedy Bipartite Matching in Random Type Poisson Arrival Model

We introduce a new random input model for bipartite matching which we ca...
research
06/13/2023

Online Matching in Geometric Random Graphs

In online advertisement, ad campaigns are sequentially displayed to user...

Please sign up or login with your details

Forgot password? Click here to reset