Algorithms for storage allocation based on client preferences

DOI10.1007/S10878-009-9259-0MaRDI QIDQ975763zbMATH OpenOpenAlexFDO

Authors Tami Tamir, Benny Vaksendiser

Publication date 11 June 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.2465

zbMATH Keywords

algorithmsheuristicsapproximationclass-constrained packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Video distribution under multiple constraints
• Adaptive Video on Demand
• The class constrained bin packing problem with applications to video-on-demand
• Sharing video on demand
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• scientific article; zbMATH DE number 2079413 (Why is no real title available?)
• scientific article; zbMATH DE number 1445307 (Why is no real title available?)
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• A note on maximizing a submodular set function subject to a knapsack constraint
• A threshold of ln n for approximating set cover
• Algorithms for non-uniform size data placement on parallel disks
• An analysis of approximations for maximizing submodular set functions—I
• Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• On two class-constrained versions of the multiple knapsack problem
• Polynomial time approximation schemes for class-constrained packing problems
• Semi-matchings for bipartite graphs and load balancing
• The budgeted maximum coverage problem

Cited in

(3)

• Video distribution under multiple constraints
• Faster algorithms for semi-matching problems
• Resource allocation games with multiple resource classes

This page was built for publication: Algorithms for storage allocation based on client preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975763)