Before revision:  We give a factor-2 approximation algorithm for Vertex Cover which runs in time n^{O(\Delta)} and uses O(\Delta log n) bits of space.
After revision:  We devise a factor-2 approximation algorithm for Vertex Cover which runs in time n^{O(\Delta)} and uses O(\Delta log n) bits of space.