Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

  • Authors:
  • Baruch Awerbuch;Tom Leighton

  • Affiliations:
  • Johns Hopkins University, Baltimore, MD and MIT Laboratory for Computer Science, Cambridge, MA;Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
  • Year:
  • 1994

Quantified Score

Hi-index 0.06

Visualization

Abstract