Hyperbolic Embeddings for Near-Optimal Greedy Routing.
Thomas BläsiusTobias FriedrichMaximilian KatzmannAnton KrohmerPublished in: ALENEX (2018)
Keyphrases
- greedy algorithm
- search algorithm
- routing algorithm
- low dimensional
- ad hoc networks
- dimensionality reduction
- routing protocol
- search space
- routing problem
- conservation laws
- qos routing
- inter domain
- locally optimal
- network topologies
- wireless ad hoc networks
- network topology
- euclidean space
- feature selection
- vector space
- shortest path
- manifold learning
- greedy heuristic
- mobile ad hoc networks
- greedy search
- partial differential equations
- end to end
- multi dimensional scaling
- forward selection
- active learning