Algorithms for storage allocation based on client preferences
From MaRDI portal
Publication:975763
DOI10.1007/S10878-009-9259-0zbMATH Open1188.90222OpenAlexW2149891005MaRDI QIDQ975763FDOQ975763
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- The budgeted maximum coverage problem
- An analysis of approximations for maximizing submodular set functions—I
- Title not available (Why is that?)
- Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
- Semi-matchings for bipartite graphs and load balancing
- A note on maximizing a submodular set function subject to a knapsack constraint
- Polynomial time approximation schemes for class-constrained packing problems
- Title not available (Why is that?)
- Algorithms for non-uniform size data placement on parallel disks
- On two class-constrained versions of the multiple knapsack problem
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
- Title not available (Why is that?)
Cited In (3)
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)