Hardness and algorithmic results for the approximate cover problem