A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes.
Steven CheungFrancis C. M. LauPublished in: Inf. Process. Lett. (1993)
Keyphrases
- lower bound
- upper bound
- three dimensional
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- d mesh
- multiresolution
- np hard
- worst case
- routing algorithm
- lower bounding
- multi dimensional
- optimal solution
- network topology
- routing problem
- shortest path
- upper and lower bounds
- wireless ad hoc networks
- mesh generation
- sufficiently accurate
- ad hoc networks
- routing protocol
- objective function
- online learning
- online algorithms
- polynomial approximation
- mobile ad hoc networks
- search space
- variable resolution
- genetic algorithm