Nearly-optimal algorithm for non-clairvoyant service with delay

Cites work

\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
A hitting set relaxation for k-server and an extension to time-windows
A match in time saves nine: deterministic online matching with delays
A primal-dual online deterministic algorithm for matching with delays
Better Approximation Bounds for the Joint Replenishment Problem
Beyond tree embeddings -- a deterministic framework for network design with deadlines or delay
Caching with time windows
Caching with time windows and delays
Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
Deterministic min-cost matching with delays
Dynamic TCP acknowledgment and other stories about e/(e-1)
Frameworks for nonclairvoyant network design with deadlines or delay
General framework for metric optimization problems with delay or with deadlines
scientific article; zbMATH DE number 5764798 (Why is no real title available?)
scientific article; zbMATH DE number 1775424 (Why is no real title available?)
scientific article; zbMATH DE number 742977 (Why is no real title available?)
scientific article; zbMATH DE number 7651147 (Why is no real title available?)
scientific article; zbMATH DE number 7788358 (Why is no real title available?)
scientific article; zbMATH DE number 7788626 (Why is no real title available?)
Improved and deterministic online service with deadlines or delay
Min-cost bipartite perfect matching with delays
Minimum cost perfect matching with delays for two sources
New results on multi-level aggregation
Online algorithms for multi-level aggregation
Online facility location with linear delay
Online matching with set and concave delays
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
Online service with delay
Online service with delay on a line
Online weighted cardinality joint replenishment problem with delay
Randomized algorithm for MPMD on two sources
The k-Server Problem with Delays on the Uniform Metric Space
The power of clairvoyance for multi-level aggregation and set cover with delay

This page was built for publication: Nearly-optimal algorithm for non-clairvoyant service with delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287815)