"Combination Can Be Hard: Approximability of the Unique Coverage Problem."

Erik D. Demaine et al. (2008)

> Home

Details and statistics

DOI: 10.1137/060656048

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/DemaineFHS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/DemaineFHS08
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour:
Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.