Time Lower Bounds for Permutation Routing on Multi-Dimensional Bused Meshes.
Steven CheungFrancis C. M. LauPublished in: Parallel Process. Lett. (1993)
Keyphrases
- multi dimensional
- lower bound
- upper bound
- branch and bound algorithm
- routing algorithm
- routing protocol
- np hard
- multiresolution
- ad hoc networks
- objective function
- d mesh
- routing problem
- optimal solution
- lower and upper bounds
- index structure
- range queries
- worst case
- multi dimensional data
- high dimensional
- lower bounding
- mesh generation
- branch and bound
- inter domain
- multiple dimensions
- implicit surfaces
- upper and lower bounds
- mobile ad hoc networks
- linear programming relaxation
- quadratic assignment problem
- vc dimension
- network topology
- data cube
- routing decisions
- star shaped
- mesh refinement
- delaunay triangulation
- data structure
- wireless sensor networks
- d objects