Lower Bounds on the Amortized Time Complexity of Shared Objects.
Hagit AttiyaArie FourenPublished in: OPODIS (2017)
Keyphrases
- lower bound
- worst case
- upper bound
- running times
- np hard
- objective function
- data objects
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- error bounds
- moving objects
- multi dimensional
- computational cost
- special case
- upper and lower bounds
- data structure
- spatial relationships
- space complexity
- average case