We show how to speed up lattice parameter searches for Monte Carlo - and quasi Monte Carlo node sets. A classical measure for such parameter searches is the spectral test which is based on a calculation of the shortest vector in a lattice. Instead of the shortest vector we apply an approximation given by the LLL-algorithm for lattice basis reduction. We demonstrate the quality obtained by the LLL-reduction and present an important application for the selection of projection stable lattices.