Login / Signup
Combination can be hard: approximability of the unique coverage problem.
Erik D. Demaine
Mohammad Taghi Hajiaghayi
Uriel Feige
Mohammad R. Salavatipour
Published in:
SODA (2006)
Keyphrases
</>
three dimensional
multi agent
combining multiple
database
data sets
high level
similarity measure
hidden markov models
upper bound