Login / Signup
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem.
George Lagogiannis
Christos Makris
Athanasios K. Tsakalidis
Published in:
J. Discrete Algorithms (2006)
Keyphrases
</>
lower bound
data structure
upper bound
objective function
lower and upper bounds
worst case
dynamic environments
dynamically changing
branch and bound algorithm
tree structure
np hard
special case
optimal solution
index structure
branch and bound
r tree
quadtree