 Nevertheless, we show that a simple greedy allocation can ensure a (1-1/e-\epsilon) -approximation to the optimum .
<clarity>  Nevertheless, we show that a simple greedy allocation can ensure a (1-1/e-\epsilon) -approximation to the optimum .
 Nevertheless, we show that a simple greedy allocation algorithm achieves a factor of (1-1/e-\epsilon) -approximation to the optimum .