Minimal cost reconfiguration of data placement in a storage area network
From MaRDI portal
Publication:690477
DOI10.1016/j.tcs.2012.06.018zbMath1253.68115MaRDI QIDQ690477
Gal Tamir, Hadas Shachnai, Tami Tamir
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.018
68P20: Information storage and retrieval of data
68W25: Approximation algorithms
68M11: Internet topics
Related Items
Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems, Incremental list coloring of graphs, parameterized by conservation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- Polynomial time approximation schemes for class-constrained packing problems
- Approximation algorithms for knapsack problems with cardinality constraints
- Threshold-based dynamic replication in large-scale video-on-demand systems
- Improved results for data migration and open shop scheduling
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- On two class-constrained versions of the multiple knapsack problem