Improved and deterministic online service with deadlines or delay
From MaRDI portal
(Redirected from Publication:6499265)
Cites work
- \(k\)-server via multiscale entropic regularization
- \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
- A fast algorithm for Steiner trees
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- Better Approximation Bounds for the Joint Replenishment Problem
- Caching with time windows and delays
- Competitive algorithms for server problems
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Dynamic TCP acknowledgment and other stories about e/(e-1)
- scientific article; zbMATH DE number 1775424 (Why is no real title available?)
- On the k -server conjecture
- Online algorithms for multi-level aggregation
- Online make-to-order joint replenishment model: primal-dual competitive algorithms
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Online service with delay
- Online service with delay on a line
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
Cited in
(8)- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online deterministic minimum cost bipartite matching with delays on a line
- Online deterministic minimum cost bipartite matching with delays on a line
- Online matching with delays and stochastic arrival times
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online multi-level aggregation with delays and stochastic arrivals
- Nearly-optimal algorithm for non-clairvoyant service with delay
- A tight lower bound for online service with deadlines and lazy server
This page was built for publication: Improved and deterministic online service with deadlines or delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499265)
