Lenore J. Cowen  Home/Search
Context Related
| jhu.edu/~cowen/sodasap.ps jhu.edu/~cowen/sodasap.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: jhu.edu/~cowen/ (more) From: jhu.edu/~cowen/index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex. The algorithm uses local routing tables of size O(n 2=3 log 4=3 n) and achieves paths that are most 3 times the length of the shortest path distances for all nodes in an arbitrary weighted undirected network. This answers an open question of Gavoille and Gengler who showed that any universal compact routing algorithm with maximum stretch strictly less than 3... (Update)
Similar documents based on text: More All
0.6: Compact Routing with Name Independence - Arias, Cowen, Laing, Rajaraman.. (2003) (Correct)
0.2: G-free Colorability and the Boolean Prime Ideal Theorem - Cowen, Hechler (2003) (Correct)
0.1: Compact Roundtrip Routing for Digraphs - Cowen, Wagner (1999) (Correct)
BibTeX entry: (Update)
L. J. Cowen. Compact routing with minimum stretch. Proceedings of this conference. http://citeseer.ist.psu.edu/33465.html More
@inproceedings{ cowen99compact,
author = "Cowen",
title = "Compact Routing with Minimum Stretch",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1999",
url = "citeseer.ist.psu.edu/33465.html" }
Citations (may not include all citations):117 Complexity of network synchronization (context) - Awerbuch - 1985
101 Implicit routing in networks (context) - Santoro, Khatib - 1985
74 the ratio of optimal integral and fractional covers (context) - Lovasz - 1975
64 Routing with polynomial communication - space trade-off - Awerbuch, Peleg - 1992
61 Designing networks with compact routing tables (context) - Frederickson, Janardan - 1988
46 Improved routing strategies with succinct tables (context) - Awerbuch, Bar-Noy et al. - 1990
37 Interval routing (context) - van Leeuwen, Tan - 1987
37 Graph spanners (context) - Peleg, Schaffer - 1989
34 Compact routing schemes with low stretch factor - Eilam, Gavoille et al. - 1998
28 Fast estimation of diameter and shortest paths (context) - Aingworth, Chekuri et al.
28 Fast estimation of diameter and shortest paths (context) - Aingworth, Chekuri et al. - 1996
27 Fast algorithms for constructing t-spanners and paths with s.. (context) - Cohen - 1999
26 A tradeoff between size and efficiency for routing tables (context) - Peleg, Upfal - 1988
26 A tradeoff between size and efficiency for routing tables (context) - Peleg, Upfal - 1989
19 All pairs almost shortest paths - Dor, Halperin et al. - 1996
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://polya.mts.jhu.edu/~cowen/): More
Randomized Non-Linear Projections Uncover High-Dimensional.. - Cowen, Priebe (1997) (Correct)
Near-Linear Cost Sequential and Distributed.. - Awerbuch, Berger.. (1993) (Correct)
Enumeration of Full Graphs: Onset of the Asymptotic Region - Cowen, Kleitman, Lasaga.. (Correct)
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