Login / Signup

The fractional congestion bound for efficient edge disjoint routing.

Alok Baveja
Published in: Networks (2008)
Keyphrases
  • network topology
  • lower bound
  • edge disjoint
  • special case
  • upper bound
  • shortest path
  • real time
  • web services
  • worst case
  • computationally efficient