Before revision:  Finally{\em   , we provide improved approximation results for the maximum variance embedding problem for general graphs, by replacing the optimal orthogonal projection (PCA) with a randomized projection approach .
After revision:  Finally{\em , we provide improved approximation results for the maximum variance embedding problem for general graphs, by replacing the optimal orthogonal projection , i.e., PCA, classically used for rounding of the optimum lifted solution (to SDP relaxation) of the problem .