A Lower Bound for Linear Interval Routing.
Tamar EilamShlomo MoranShmuel ZaksPublished in: WDAG (1996)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- np hard
- worst case
- routing problem
- optimal solution
- upper and lower bounds
- neural network
- routing algorithm
- lower and upper bounds
- mobile ad hoc networks
- routing decisions
- search algorithm
- shortest path
- linear constraints
- wireless ad hoc networks
- sufficiently accurate