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