Combination can be hard: approximability of the unique coverage problem (0)

by E D Demaine, U Feige, M T Hajiaghayi, M R Salavatipour
Venue:SIAM J. Comput