scientific article; zbMATH DE number 5485535

MaRDI QIDQ3549707zbMATH OpenFDO

Authors N. Bansal, Niv Buchbinder, Joseph (Seffi) Naor

Publication date 5 January 2009

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cited in

(9)

• Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
• On variants of file caching
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• Caching Content under Digital Rights Management
• Resource Management in Large Networks
• A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
• An \(O(\log k)\)-competitive algorithm for generalized caching
• Caching connections in matchings
• Caching is hard -- even in the fault model

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)