Minimal Cost Reconfiguration of Data Placement in Storage Area Network

DOI10.1007/978-3-642-12450-1_21zbMath1284.68675OpenAlexW2177344237MaRDI QIDQ3558929

Gal Tamir, Hadas Shachnai, Tami Tamir

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_21

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

A theory and algorithms for combinatorial reoptimization

This page was built for publication: Minimal Cost Reconfiguration of Data Placement in Storage Area Network