Randomized competitive algorithms for generalized caching
From MaRDI portal
Recommendations
Cited in
(22)- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- On-line algorithm of loose competitive caching
- Facility Location with Matroid or Knapsack Constraints
- Online file caching with rejection penalties
- Economical Caching with Stochastic Prices
- Approximating sparse covering integer programs online
- More on randomized on-line algorithms for caching.
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
- Cache replacement with memory allocation
- An \(O(\log k)\)-competitive algorithm for generalized caching
- An \(O(\log k)\)-competitive algorithm for generalized caching
- Competitive Caching with Machine Learned Advice
- On variants of file caching
- scientific article; zbMATH DE number 7758362 (Why is no real title available?)
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Nonlinear paging
- Frequency capping in online advertising
- All or Nothing Caching Games with Bounded Queries
- Randomized weighted caching with two page weights
- A primal-dual randomized algorithm for weighted paging
- Distributional online weighted paging with limited horizon
- Online covering with \(\ell_q\)-norm objectives and applications to network design
This page was built for publication: Randomized competitive algorithms for generalized caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903523)
