Before revision:  When insertions and deletions are considered, we achieve a packing density of (1-\epsilon) of the optimal, where \epsilon>0 can be made arbitrarily small, for an additional amortized reallocation cost of O(  c1{\epsilon}).
After revision:  When insertions and deletions are considered, we achieve a packing density of (1-\epsilon) of the optimal, where \epsilon>0 can be made arbitrarily small, with an amortised reallocation cost of O( c1{\epsilon}).