Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ran Adler, Yossi Azar. Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. In SODA. pages 1-10, 1999. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control AlgorithmsRan Adler, Yossi Azar. scheduling, 6(2):113-129, 2003. A Preemptive Algorithm for Maximizing Disjoint Paths on TreesYossi Azar, Uriel Feige, Daniel Glasner. swat 2008: 319-330 [doi] A Preemptive Algorithm for Maximizing Disjoint Paths on TreesYossi Azar, Uriel Feige, Daniel Glasner. algorithmica, 57(3):517-537, 2010. [doi]
The following publications are possibly variants of this publication: