Most online problems with delay require clairvoyance, the future delay of a request is known
upon its arrival, to achieve polylogarithmic competitiveness. An exception is Set Cover with …

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 …

The famous k-Server Problem covers plenty of resource allocation scenarios, and several
variations have been studied extensively for decades. However, to the best of our …

Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy
performs better than the real-time matching mode, it still has the following two drawbacks:(1) …

We study an online generalization of the classic Joint Replenishment Problem (JRP) that
models the trade-off between ordering costs, holding costs, and backlog costs in supply …

We initiate the study of online problems with set delay, where the delay cost at any given
time is an arbitrary function of the set of pending requests. In particular, we study the online …

The online joint replenishment problem (JRP) is a fundamental problem in the area of online
problems with delay. Over the last decade, several works have studied generalizations of …

The cost due to delay in services may be intrinsically different for various applications of
vehicle routing such as medical emergencies, logistical operations, and ride-sharing. We …

With the rise of cloud computing worldwide, cloud providers are confronted with questions
such as" Where to place virtual servers of a client?" and" Which services to provide at a …

Traditionally, an online algorithm must service a request upon its arrival. In many practical
situations, one can delay the service of a request in the hope of servicing it more efficiently in …