Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

  • Authors:
  • Ran Adler;Yossi Azar

  • Affiliations:
  • Department of Computer Science, Tel Aviv University, Tel-Aviv 69978,Israel;Department of Computer Science, Tel Aviv University, Tel-Aviv 69978,Israel

  • Venue:
  • Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract