Deterministic constructions of approximate distance oracles and spanners

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 261-272

  Roditty, Liam ^a   Thorup, Mikkel ^b   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; GRAPH THEORY;

ASYMPTOTIC LOSS; ORACLES; POSITIVELY WEIGHED UNDIRECTED GRAPH;

COMPUTER PROGRAMMING;

EID: 26444492566     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_22     Document Type: Conference Paper

References (16)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167-1181, 1999.
2. N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
3. N. Alon and J.H. Spencer. The probabilistic method. Wiley-Interscience, 2nd edition, 2000.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263-277, 1999.
5. 1+1/k) size for weighted graphs. In Proc. of 30th ICALP, pages 384-296, 2003.
6. 2 log n) time. In Proc. of 15th SODA, pages 264-273, 2004.
7. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28:210-236, 1999.
8. E. Cohen and U. Zwick. All-pairs small-stretch paths. Journal of Algorithms, 38:335-353, 2001.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, 2nd edition, 2001.
10. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
11. M. Elkin. Computing almost shortest paths. In Proc. of 20th PODC, pages 53-62, 2001.
12. M.L. Elkin and D. Peleg. (1 + ∈, β)-Spanner constructions for general graphs. SIAM Journal on Computing, 33(3):608-631, 2004.
13. M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31:538-544, 1984.
14. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
15. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
16. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1-24, 2005.