Next: Compression and Representation
Up: Data Storage
Previous: MAXIMUM D-VECTOR COVERING
Set A of items to be stored, each
having a size
an arrival time
and a departure time
A feasible allocation of storage for A, i.e., a function
such that, for all ,
nonempty then either
The size of the allocation, i.e.,
- Good News:
Approximable within 5 .
Approximable within 5/2 if the sizes are powers of 2 and within 2
if only two sizes are allowed .