scientific article; zbMATH DE number 5485535
From MaRDI portal
Publication:3549707
zbMATH Open1231.68278MaRDI QIDQ3549707FDOQ3549707
Authors: N. Bansal, Niv Buchbinder, Joseph (Seffi) Naor 
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
Cited In (8)
- Caching is hard -- even in the fault model
- Resource Management in Large Networks
- An \(O(\log k)\)-competitive algorithm for generalized caching
- Caching Content under Digital Rights Management
- On variants of file caching
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549707)
