We prove that the minimum line covering problem and the minimum guard covering problem restricted to 2-link polygons are APX-hard.