Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.

Ran Adler Yossi Azar

Published in: SODA (1999)

Keyphrases

lower bound
worst case
randomized algorithms
randomized algorithm
lower and upper bounds
np hard
combinatorial optimization
upper bound
optimal solution
learning algorithm
computationally efficient
computational cost
branch and bound algorithm
control system
online algorithms
data structure
disjoint paths