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. In SODA. pages 1-10, 1999. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.