Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing.
Kim-Heng TeoTai-Ching TuanPublished in: Inf. Process. Lett. (1990)
Keyphrases
- greedy heuristic
- greedy algorithm
- np hard
- optimal solution
- knapsack problem
- routing protocol
- minimum weight
- routing algorithm
- routing problem
- lower bound
- ad hoc networks
- layout design
- network topology
- set cover
- water quality
- worst case analysis
- network layer
- travel distance
- wireless ad hoc networks
- average case
- response time
- machine learning
- routing decisions
- neural network