NextBestOnce: Achieving Polylog Routing despite Non-greedy Embeddings.
Stefanie RoosThorsten StrufePublished in: CoRR (2014)
Keyphrases
- greedy algorithm
- relative error
- routing problem
- routing algorithm
- routing protocol
- network topology
- search algorithm
- dynamic programming
- ad hoc networks
- feature selection
- locally optimal
- search space
- low dimensional
- vector space
- network topologies
- multicast routing
- inter domain
- euclidean space
- mobile ad hoc networks
- distance measure
- binary codes
- greedy algorithms
- network layer
- evolutionary algorithm
- marginal utility