Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms.

Alan Roberts Antonios Symvonis David R. Wood

Published in: Comput. J. (2002)

Keyphrases

lower bound
learning algorithm
worst case
theoretical analysis
upper and lower bounds
data structure
computational complexity
objective function
optimization problems
peer to peer
shortest path
ad hoc networks
network topology
lower and upper bounds
binary trees