Approximation algorithms for a geometric set cover problem

Given a finite set of straight line segments S in R-2 and some k is an element of N, is there a subset V of points on segments in S with vertical bar V vertical bar <= k such that each segment of S contains at least one point in V? This is a special case of the set covering problem where the family of subsets given can be taken as a set of intersections of the straight line segments in S. Requiring that the given subsets can be interpreted geometrically this way is a major restriction on the input, yet we have shown that the problem is still strongly NP-complete [5]. In light of this result, we studied the accuracy of two polynomial-time approximation algorithms along with a third heuristic based algorithm which return segment coverings. We obtain certain theoretical results, and in particular we show that the performance ratio for each of these algorithms is unbounded, in general. Despite this, our experimental results suggest that the cases where this ratio exceeds 2 are rare for "reasonable" methods of placing segments. This is evidence that these polynomial-time algorithms solve the problem accurately in practice. Published by Elsevier B.V.