Login / Signup
A general lower bound for collaborative tree exploration.
Yann Disser
Frank Mousset
Andreas Noever
Nemanja Skoric
Angelika Steger
Published in:
Theor. Comput. Sci. (2020)
Keyphrases
</>
lower bound
upper bound
special case
objective function
tree structure
information retrieval
lower and upper bounds
data sets
bayesian networks
multi dimensional
collaborative learning
index structure
r tree
branch and bound algorithm
constant factor