We study a generalization of the classic Online Joint Replenishment Problem (JRP) with
Delays that we call the Online Weighted Cardinality JRP with Delays. The JRP is an …

Consider a platform where independent agents arrive at random times and need to be
matched into pairs, eventually after waiting for some time. This, for example, models job …

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 …

In this paper, we present a framework used to construct and analyze algorithms for online
optimization problems with deadlines or with delay over a metric space. Using this …

We consider network design problems with deadline or delay. All previous results for these
models are based on randomized embedding of the graph into a tree (HST) and then …

We consider the problem of online min-cost perfect matching with concave delays. We begin
with the single location variant. Specifically, requests arrive in an online fashion at a single …

Abstract In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m requests arrive
over time at points of a metric space. An online algorithm has to connect these requests in …

We study the online minimum cost bipartite perfect matching with delays problem. In this
problem, $ m $ servers and $ m $ requests arrive over time, and an online algorithm can …

In network design problems with deadlines/delay, an algorithm must make transmissions
over time to satisfy connectivity requests on a graph. To satisfy a request, a transmission …

In most online problems with delay, clairvoyance (ie knowing the future delay of a request
upon its arrival) is required for polylogarithmic competitiveness. In this paper, we show that …