On the complexity of approximating the independent set problem

We show that for some positive constant c it is not feasible to approximate Independent Set (for graphs of n vertices) within a factor of nc, provided Maximum 2-Satisfiability does not have a randomized polynomial time approximation scheme. We also study reductions preserving the quality of approximations and exhibit complete problems.