Adler Ran

Ran Adler

Information about the author Ran Adler will soon be added to the site.
Found 1 papers in total
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
2003
We consider the maximum disjoint paths problem and its generalization, the call...
Papers per page: