We present an $O(n^{3.5})$ approximation algorithm for maximum independent set problem achieving, in unweighted case, a worst case approximation ratio strictly greater than $(2 / \Delta )$, for a graph of order n and maximum vertex degree $\Delta$. The best known ratio was, up to now, equal to $2 / \Delta$ and its improvement is considered as an interesting open problem.