Login / Signup
Worst case constant time priority queue.
Andrej Brodnik
Svante Carlsson
Johan Karlsson
J. Ian Munro
Published in:
SODA (2001)
Keyphrases
</>
priority queue
worst case
data structure
upper bound
average case
error bounds
lower bound
greedy algorithm
np hard
approximation algorithms
service times
running times
worst case scenario
mistake bound
space complexity
worst case analysis
sample size
coalition structure generation
search algorithm