Login / Signup
An Optimal Time Bound for Oblivious Routing.
Ian Parberry
Published in:
Algorithmica (1990)
Keyphrases
</>
worst case
lower bound
neural network
integer solution
upper bound
shortest path
routing algorithm
provide an upper bound
optimal cost
asymptotically optimal
routing protocol
dynamic programming
optimal solution
closed form
estimation error
multipath
optimal design
wireless ad hoc networks
closed form expressions
case study