Hyperbolic Embeddings for Near-Optimal Greedy Routing.
Thomas BläsiusTobias FriedrichMaximilian KatzmannAnton KrohmerPublished in: ACM J. Exp. Algorithmics (2020)
Keyphrases
- greedy algorithm
- routing algorithm
- dynamic programming
- search algorithm
- routing problem
- routing protocol
- feature selection
- manifold learning
- greedy algorithms
- vector space
- ad hoc networks
- multicast routing
- hill climbing
- inter domain
- qos routing
- dimensionality reduction
- euclidean space
- shortest path
- greedy search
- search space
- wireless ad hoc networks
- conservation laws
- routing decisions
- greedy strategy
- principal component analysis
- neural network
- low dimensional
- partial differential equations