Worst-Case Optimal Priority Queues via Extended Regular Counters.

Amr Elmasry Jyrki Katajainen

Published in: CSR (2012)

Keyphrases

worst case
approximation algorithms
upper bound
lower bound
priority queue
greedy algorithm
dynamic programming
np hard
average case
error bounds
space complexity
running times
closed form
exhaustive search
floating point
asymptotically optimal
constant factor
computational complexity
coalition structure generation