The {\em Unique Coverage} problem, given a universe V of elements and a collection E of subsets of V , asks to find S V to maximize the number of e E that intersects S in {\em exactly one} element. When each e E has cardinality at most k , it is also known as {\em 1 -in- k Hitting Set}, and admits a simple ( 1 log k ) -approximation algorithm.

For constant k , we prove that 1 -in- k Hitting Set is NP-hard to approximate within a factor O ( 1 log k ) . This improves the result of Guruswami and Zhou [SODA'11, ToC'12], who proved the same result assuming the Unique Games Conjecture. For Unique Coverage, we prove that it is hard to approximate within a factor O ( 1 log 1 − n ) for any 0"> 0 , unless NP admits quasipolynomial time algorithms. This improves the results of Demaine et al. [SODA'06, SICOMP'08], including their 1 log 1 3 n inapproximability factor which was proven under the Random 3SAT Hypothesis. Our simple proof combines ideas from two classical inapproximability results for Set Cover and Constraint Satisfaction Problem, made efficient by various derandomization methods based on bounded independence.