Everything is better with sprinkles: Greedy routing with bounded stretch.
Christoph WerleOliver P. WaldhorstPublished in: FGCT (2013)
Keyphrases
- greedy algorithm
- search algorithm
- routing protocol
- routing algorithm
- routing problem
- network topology
- ad hoc networks
- feature selection
- dynamic programming
- wireless ad hoc networks
- locally optimal
- search space
- decision trees
- dynamic routing
- machine learning
- data sets
- qos routing
- quality of service
- learning algorithm
- neural network