A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Improved routing strategies with succinct tables
Journal of Algorithms
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor
Journal of Algorithms
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
ACM SIGACT News
| Hi-index | 0.00 |
We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size Õ(n1/k log D), and stretch (4 -- α)k -- β for some absolute constants α, β 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c