Abstract (EN)

We present in this paper differential approximation results for min set cover and min weighted set cover . We first show that the differential approximation ratio of the natural greedy algorithm for min set cover is bounded below by~1.365/Δ and above by 4/(Δ+1), where~Δ is the maximum set-cardinality in the min set cover-instance. Next we study another approximation algorithm for min set cover that computes 2-optimal solutions, i.e., solutions that cannot be improved by removing two sets belonging to them and adding another set not belonging to them. We prove that the differential approximation ratio of this second algorithm is bounded below by 2/(Δ+1) and that this bound is tight. Finally, we study an approximation algorithm for min weighted set cover and provide a tight lower bound of~1/Δ. Our results identically hold for max hypergraph independent set in both the standard and the differential approximation paradigms.