Compact Routing with Minimum Stretch

Journal of Algorithms

Volumn 38, Issue 1, 2001, Pages 170-183

  Cowen, Lenore J ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000989779     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1134     Document Type: Article

References (29)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), unpublished manuscript.
2. D. Aingworth, C. Chekuri, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia, Jan. 28-30, 1996," pp. 547-553.
3. B. Awerbuch, Complexity of network synchronization, J. Assoc. Comput. Mach. 32 (1985), 804-823.
4. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Compact distributed data structures for adaptive network routing, in "Proc. 21st ACM Symp. on Theory of Computing," pp. 479-489, May 1989.
5. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990), 307-341.
6. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Near-linear time construction of sparse neighborhood covers, SIAM J. Comput. 28 (2000), 263-277.
7. B. Awerbuch and D. Peleg, Routing with polynomial communication - space trade-off, SIAM J. Discrete Math. 5 (1992), 151-162.
8. E. Cohen, Fast algorithms for constructing t-spanners and paths with stretch t, SIAM J. Comput. 28 (2000), 210-236.
9. E. Cohen and U. Zwick, All-pairs small-stretch paths, in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, Jan. 5-7, 1997," pp. 93-102.
10. L. Cowen and C. G. Wagner, Compact roundtrip routing in digraphs, in "Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. S885-886, 1999.
11. L. J. Cowen and C. G. Wagner, Compact roundtrip routing in directed networks, in "Proc. 19th ACM Symp. on Principles of Distrib. Computing," Assoc. Comput. Mach., New York, July 2000.
12. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959), 269-271.
13. D. Dor, S. Halperin, and U. Zwick, All pairs almost shortest paths, in "37th Annual Symposium on Foundations of Computer Science, Burlington, VT, Oct 14-16, 1996," IEEE Press, New York.
14. T. Eilam, C. Gavoille, and D. Peleg, Compact routing schemes with low stretch factor, in "17th Annual ACM Symposium on Principles of Distributed Computing (PODC)," pp. 11-20, 1998.
15. T. Eilam, C. Gavoille, and D. Peleg, "Compact Routing Schemes with Low Stretch Factor," Technical Memo RR-1195-98, Laboratoire Bordelais de Recherche en Informatique, Jan. 1998. Full version of paper in PODC98.
16. G. N. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988), 171-190.
17. G. N. Frederickson and R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18 (1989), 843-857.
18. C. Gavoille, "A Survey on Interval Routing Scheme," Technical Memo RR-1182-97, Laboratoire Bordelais de Recherche en Informatique, Oct. 1997.
19. C. Gavoille and M. Gengler, Space-efficiency of routing schemes of stretch factor three, in "4th International Colloquium on Structural Information and Communication Complexity (SIROCCO)," pp. 162-175, July 1997.
20. K. Iwama and A. Kawachi, Compact routing with stretch factor of less than three, in "Proc. 19th ACM Symp. on Principles of Distrib. Computing," Assoc. Comput. Mach., New York, July 2000.
21. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
22. D. Peleg and A. A. Schäffer, Graph spanners, J. Graph Theory 13 (1989), 99-116.
23. D. Peleg and E. Upfal, A tradeoff between size and efficiency for routing tables, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing," pp. 43-52, Assoc. Comput. Mach., New York, May 1988.
24. D. Peleg and E. Upfal, A tradeoff between size and efficiency for routing tables, J. Assoc. Comput. Mach. 36 (1989), 510-530.
25. N. Santoro and R. Khatib, Implicit routing in networks, Comput. Sci. J. 28 (1985), 5-8.
26. R. Stanley, "Enumerative Combinatorics," Vol. 1, Wadsworth and Brooks/Cole, Monterey, CA, 1986.
27. J. van Leeuwen and R. Tan, Routing with compact routing tables, in "The Book of L" (G. Roznenberg and A. Salomaa, Eds.), pp. 259-273, Springer-Verlag, New York, 1986.
28. J. van Leeuwen and R. Tan, Interval routing, Comp. J. 30 (1987), 259-273.
29. C. Wagner, "Drawing with Bezier Curves and Routing on Digraphs," PhD thesis, Dept. of Mathematical Sciences, Johns Hopkins University, 1999.