Login / Signup
Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.
Eric Torng
Patchrawat Uthaisombut
Published in:
SODA (1999)
Keyphrases
</>
lower bound
upper bound
upper and lower bounds
theoretical analysis
learning algorithm
worst case
parallel machines
data structure
computationally efficient
computational complexity
dynamic programming
scheduling problem
optimization problems
branch and bound