## Combination Can Be Hard: Approximability of the Unique Coverage Problem (2006)

### Cached

### Download Links

- [www.cs.ualberta.ca]
- [erikdemaine.org]
- [www-math.mit.edu]
- [www-math.mit.edu]
- DBLP

### Other Repositories/Bibliography

by
Erik D. Demaine
,
Uriel Feige
,
Mohammadtaghi Hajiaghayi
,
Mohammad R. Salavatipour

Venue: | In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms |

Citations: | 79 - 2 self |