scientific article; zbMATH DE number 1445307

zbMath0961.68010MaRDI QIDQ4952620

Sanjeev Khanna, Leana Golubchik, Ramakrishna Thurimella, An Zhu, Samir Khuller

Publication date: 10 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data placement problemmultimedia storage systems

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data structures (68P05)

Related Items (14)

Data migration on parallel disks: Algorithms and evaluation ⋮ Polynomial time approximation schemes for class-constrained packing problems ⋮ Algorithms for data migration ⋮ Tight bounds for online class-constrained packing ⋮ Approximation schemes for generalized two-dimensional vector packing with application to data placement ⋮ Improved approximation algorithms for data migration ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Almost optimal solutions for bin coloring problems ⋮ Minimal cost reconfiguration of data placement in a storage area network ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Class constrained bin covering ⋮ Algorithms for storage allocation based on client preferences ⋮ A note on dual approximation algorithms for class constrained bin packing problems ⋮ Locality-preserving allocations problems and coloured bin packing

This page was built for publication: