Before revision:  This generalizes the result of Eisenbrand et al. which applies to the \ell_\infty-norm. As it is the case for the covering procedure of Eisenbrand et al., our approach boosts any constant factor approximation algorithm to a (1+\epsilon)-approximate algorithm. By assuming the existence of a poly(n)-space and 2^{O(n) .
After revision:  Finally, we establish a connection between the and 2^{O(n) .