In the Bin Packing problem, given a set of items, the objective is to find a packing of the items into the minimum number of bins possible. Vector Bin Packing is a natural generalization of the classic bin packing problem where given a set of d-dimensional vectors from (0,1]^d, and the aim is to partition the set into  bins such that for each bin B, we have \left\|v\in Bv\right\|_\infty\leq 1. Woeginger claimed to prove (in [Woe97] ) that the problem has no APTAS for dimensions greater than  2. We note that there was a slight oversight in the original proof. Hence, we give a revised proof using some additional ideas from [BCKS06  ]. In fact, we show that it is NP-hard to get an asymptotic approximation ratio better than 600{599}  v\geq \mathbf 1. Using ideas similar to our vector bin packing result, we show that for vector bin covering there is no APTAS for dimensions greater than or equal to 2. In fact, we show that it is NP-hard to get an asymptotic approximation ratio better than 998{997}} .
We study vector bin packing and vector bin covering problems, multidimensional generalizations of the classical bin packing and bin covering problems, respectively. In Vector Bin Packing we are given a set of d-dimensional vectors from (0,1]^d, and the aim is to partition the set into the minimum number of bins such that for each bin B, we have \left\|v\in Bv\right\|_\infty\leq 1. Woeginger [Woe97] claimed that the problem has no APTAS for dimensions greater than or equal to 2. We note that there was a slight oversight in the original proof. Hence, we give a revised proof using some additional ideas from [BCKS06 , CC09 ]. In fact, we show that it is NP-hard to get an asymptotic approximation ratio better than 600{599} , for d=2. In the vector bin covering problem given a set of d-dimensional vectors from (0,1 ^d, the aim is to obtain a family of disjoint subsets (called bins) with the maximum cardinality such that for each bin B, we have \sum_{v\in Bv\geq \mathbf 1. Using ideas similar to our vector bin packing result, we show that for vector bin covering there is no APTAS for dimensions greater than or equal to 2. In fact, we show that it is NP-hard to get an asymptotic approximation ratio better than 998{997}} .
R
In the Bin Packing problem, given a set of items, the objective is to find a packing of the items into the minimum number of bins possible.
We study vector bin packing and vector bin covering problems, multidimensional generalizations of the classical bin packing and bin covering problems, respectively. In
R
is a natural generalization of the classic bin packing problem where
we are
A
the minimum number of
D
claimed to prove (in
R
)
claimed
A
or equal to
A
, CC09
A
, for d=2. In the vector bin covering problem given a set of d-dimensional vectors from (0,1
A
^d, the aim is to obtain a family of disjoint subsets (called bins) with the maximum cardinality such that for each bin B, we have \sum_{v\in B