Before revision:  This result generalizes the 1-1/e optimal factor for the rank one (i. e. k=1) case, and improves it for any k>1.
After revision:  While this bound can be obtained by combining previously known results, these require defining an exponential-sized linear program and using random sampling and the ellipsoid algorithm. Our procedure, on the other hand, has the advantage of being simple and explicit.