Universal optimization for non-clairvoyant subadditive joint replenishment
From MaRDI portal
Cites work
- \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
- A constant factor approximation for the single sink edge installation problem
- 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
- Combinatorial auctions with decreasing marginal utilities
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Deterministic min-cost matching with delays
- Dynamic TCP acknowledgement 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 7051222 (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?)
- Impatient Online Matching
- Improved and deterministic online service with deadlines or delay
- Job Matching, Coalition Formation, and Gross Substitutes
- Min-cost bipartite perfect matching with delays
- Minimum cost perfect matching with delays for two sources
- New results on multi-level aggregation
- On-line analysis of the TCP acknowledgment delay problem
- Online Algorithms for Multilevel Aggregation
- Online facility location with linear delay
- Online matching with set and concave delays
- Online matching: haste makes waste!
- 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
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- Sketching valuation functions
- The k-Server Problem with Delays on the Uniform Metric Space
- The online set aggregation problem
- The power of clairvoyance for multi-level aggregation and set cover with delay
- Two Randomized Mechanisms for Combinatorial Auctions
- Universal approximations for TSP, Steiner tree, and set cover
- Welfare guarantees for combinatorial auctions with item bidding
This page was built for publication: Universal optimization for non-clairvoyant subadditive joint replenishment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920834)
