Algorithms for storage allocation based on client preferences

DOI10.1007/s10878-009-9259-0zbMath1188.90222OpenAlexW2149891005MaRDI QIDQ975763

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)

Related Items (2)

Resource Allocation Games with Multiple Resource Classes ⋮ Faster Algorithms for Semi-Matching Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial time approximation schemes for class-constrained packing problems
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• Algorithms for non-uniform size data placement on parallel disks
• Semi-matchings for bipartite graphs and load balancing
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• On two class-constrained versions of the multiple knapsack problem

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