Combination can be hard: approximability of the unique coverage problem.

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour

Browse the full SODA paper archive.