9 search results - page 1 / 2 » A space lower bound for name-independent compact routing in ... |
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
SPAA
2006
ACM
13 years 11 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
INFOCOM
2009
IEEE
14 years 2 days ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...