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

by E D Demaine, U Feige, M T Hajiaghayi, M R Salavatipour
Venue:Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM