Before revision:  Our main result is an almost optimal polynomial time (1-e^{-1}-   )-approximation algorithm for the problem, for any   >0.
After revision:  Our main result is an almost optimal polynomial time (1-e^{-1}-  \varepsilon )-approximation algorithm for the problem, for any  >0.