M.L. Elkin and D. Peleg. (1 + #, #)-Spanner constructions for general graphs. In Proc. of 33rd STOC, pages 173--182, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Interval Routing in Reliability Networks - Gavoille, Nehéz (2003) (Correct)
....a shortest path between its extremities plus . A stretched routing scheme is a scheme for which all the routes are stretched paths. The parameter is also called the deviation of the routing scheme. It is provable that even a small deviation allows better optimizations for spanner construction [EP01] and distance computation [GKK 01] and yields also compact routing tables [DG02] 1.2 Routing Tables and Interval Routing Finally we focus on interval routing schemes, a particular way of implementing standard routing tables [SK85, vLT87] Recall that a routing table on a graph G consists ....
Michael Elkin and David Peleg. (1 + ; )-spanner constructions for general graphs. In 33 Annual ACM Symposium on Theory of Computing (STOC), pages 173-182, Hersonissos, Crete, Greece, July 2001.
Dynamic Approximate All-Pairs Shortest Paths In Undirected Graphs - Roditty, Zwick (Correct)
No context found.
M.L. Elkin and D. Peleg. (1 + #, #)-Spanner constructions for general graphs. In Proc. of 33rd STOC, pages 173--182, 2001.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
M.L. Elkin and D. Peleg. (1 + #, #)-Spanner constructions for general graphs. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, pages 173--182, 2001. 21
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
M. Elkin and D. Peleg. (1 + ; )-Spanner constructions for general graphs. In Proc. 33th STOC, 2001. To appear.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
M.L. Elkin and D. Peleg. (1 + ; )-Spanner constructions for general graphs. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001. To appear.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
M.L. Elkin and D. Peleg. (1 + ffl; fi)-Spanner constructions for general graphs. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC