Combination Can Be Hard: Approximability of the Unique Coverage Problem

We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elements covered exactly once. Specifically, we prove Ǵ

• Type: Journal
• Year: 2008
• Where: SIAMCOMP
• Authors: Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour
• Keywords: Ç´½ ÐÓ, Òµ Inapproximability, SIAMCOMP 2008, Unique Coverage