Minimal cost reconfiguration of data placement in a storage area network

DOI10.1016/j.tcs.2012.06.018zbMath1253.68115OpenAlexW2165459538MaRDI 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

zbMATH Keywords

approximation algorithmsvideo-on-demandreconfigurationdata placement

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Internet topics (68M11)

Related Items (2)

Incremental list coloring of graphs, parameterized by conservation ⋮ Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems

Uses Software

• Knapsack

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

This page was built for publication: Minimal cost reconfiguration of data placement in a storage area network