Login / Signup
Minimum constellation covers: hardness, approximability and polynomial cases.
Santiago Valdés Ravelo
Published in:
J. Comb. Optim. (2021)
Keyphrases
</>
computational complexity
data sets
real time
knowledge base
image sequences
objective function
multi agent
np hard
worst case
np complete
test cases
spatial relations
learning theory
np hardness