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

Ran Adler Yossi Azar Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. 113-129 2003 6 J. Scheduling 2 db/journals/scheduling/scheduling6.html#AdlerA03