Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids.
Martin DietzfelbingerPhilipp WoelfelPublished in: SODA (2014)
Keyphrases
- higher dimensional
- lower bound
- small world
- upper bound
- small world networks
- scale free
- power law
- network topology
- euclidean space
- high dimensional
- complex networks
- social networks
- path length
- worst case
- network structure
- low dimensional
- np hard
- small world properties
- optimal solution
- routing protocol
- random graphs
- shortest path
- network topologies
- clustering coefficient
- objective function
- feature selection
- biological networks
- computational complexity