Pages that link to "Item:Q2903523"
From MaRDI portal
The following pages link to Randomized competitive algorithms for generalized caching (Q2903523):
Displaying 14 items.
- Frequency capping in online advertising (Q490332) (← links)
- Randomized weighted caching with two page weights (Q1348912) (← links)
- More on randomized on-line algorithms for caching. (Q1401208) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description) (Q3541710) (← links)
- Page replacement for general caching problems (Q4252268) (← links)
- All or Nothing Caching Games with Bounded Queries (Q4608745) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- (Q6058190) (← links)