A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Fast estimation of diameter and shortest paths (without matrix multiplication)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Journal of Algorithms
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
ACM Transactions on Algorithms (TALG)
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Small stretch pairwise spanners
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
The first sublinear average space universal compact routing schemes for directed networks are presented. For each integer k ≥ 1, they use O(k log n)size addresses; Õ(kn1/(k+1))-sized routing tables on average at each node; and achieve roundtrip routes of stretch at most 2k+1 - 1 in any (weighted) directed network. We also present universal compact roundtrip routing schemes with the stronger requirement that they use sublinear maximum space at every node. These schemes also use O(k log n) size addresses and achieve roundtrip routes of stretch at most 2k+ 1 -1 in any (weighted) directed network, and they bound the maximum sized table at each node by Õ(kn(3k+1)/(2ċ3k)).