Next: MINIMUM DYNAMIC STORAGE ALLOCATION Up: Data Storage Previous: MINIMUM HEIGHT TWO DIMENSIONAL Index

### MAXIMUM D-VECTOR COVERING

- INSTANCE: Set X of vectors in [0,1]d.

- SOLUTION: A partition of X into m subsets .

- MEASURE: The number of unit covers in where a set S of vectors in [0,1]d is a unit cover if, for any , the sum of the i-th components of the elements in S is at least 1.

- Good News: Approximable within 4/3 for d=1 [39] and within for [11].