Roundtrip spanners and roundtrip routing in directed graphs

ACM Transactions on Algorithms

Volumn 4, Issue 3, 2008, Pages

  Roditty, Iam ^a   Thorup, Mikkel ^b,d   Zwick, Uri ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b AT AND T LABS RESEARCH   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Distances; Roundtrip; Routing; Shortest paths; Spanners

Indexed keywords

DIRECTED GRAPHS; EDGE WEIGHTS; EFFICIENT ALGORITHMS; ROUND TRIPS;

GRAPH THEORY;

EID: 47249126271     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1367064.1367069     Document Type: Conference Paper

References (15)

1. ALON, N., AND NAOR, M. 1996. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434-449.
2. ALTHÖFER, I., DAS, G., DOBKIN, D., JOSEPH, D., AND SOARES, J. 1993. On sparse spanners of weighted graphs. Disc. Comput. Geom. 9, 81-100.
3. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1999. Near-linear time construction of sparse neighborhood covers. SIAM J. Comput. 28, 263-277. (A preliminary version appears at the Proceedings of FOCS'93.)
4. COHEN,E. 1999. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210-236.
5. COHEN, E., AND ZWICK, U. 2001. All-pairs small-stretch paths. J. Algor. 38, 335-353.
6. COWEN, L. 2001. Compact routing with minimum stretch. J. Algor. 38, 170-183.
7. COWEN, L., AND WAGNER, C. 1999. Compact roundtrip routing in digraphs. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD). ACM, New York, 885-886.
8. COWEN, L., AND WAGNER, C. 2000. Compact roundtrip routing in directed graphs. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (Portland, OR). ACM, New York, 51-59.
9. FRAIGNIAUD, P., AND GAVOILLE, C. 2001. Routing in trees. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (Crete, Greece), 757-772.
10. FREDMAN, M., KOMLÓS, J., AND SZEMERÉDI, E. 1984. Storing a sparse table with O(1) worst case access time. J. ACM 31, 538-544.
11. HAGERUP, T., MILTERSEN, P., AND PAGH, R. 2001. Deterministic dictionaries. J. Algo. 41, 69-85.
12. PAGH, R. 2000. Faster deterministic dictionaries. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA). ACM, New York, 487-493.
13. PELEG, D. 2000. Distributed Computing - A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
14. THORUP, M., AND ZWICK, U. 2001. Compact routing schemes. In Porceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Crete, Greece). ACM, New York, 1-10.
15. THORUP, M., AND ZWICK, U. 2005. Approximate distance oracles. J. ACM 52, 1, 1-24.