Combination Can Be Hard: Approximability of the Unique Coverage Problem

Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour. Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM Journal on Computing, 38(4):1464-1483, 2008. [doi]

Abstract

Abstract is missing.