Lower bounds for hot-potato permutation routing on trees.
Alan RobertsAntonios SymvonisDavid R. WoodPublished in: SIROCCO (2000)
Keyphrases
- lower bound
- upper bound
- decision trees
- branch and bound
- objective function
- routing algorithm
- branch and bound algorithm
- routing problem
- routing protocol
- lower and upper bounds
- worst case
- np hard
- travel distance
- optimal solution
- network topology
- ad hoc networks
- quadratic assignment problem
- lower bounding
- tree nodes
- tree structures
- upper and lower bounds
- shortest path
- tree structure
- search space
- set of randomly generated instances