A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs

Random Structures and Algorithms

Volumn 30, Issue 4, 2007, Pages 532-563

  Baswana, Surender ^a,c   Sen, Sandeep ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Graph algorithms; Randomized algorithms; Shortest path; Spanner

Indexed keywords

EID: 34547329379     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20130     Document Type: Article

References (38)

1. A. Aggarwal and J. S. Vitter, The input/output complexity of sorting and related problems, Commun ACM 31 (1988), 1116-1127.
2. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), SIAM J Comput 28 (1999), 1167-1181.
3. N. Alon, S. Hoory, and N. Linial, The Moore bound for irregular graphs, Graph Comb, to appear, 2000.
4. N. Alon and N. Megiddo, Parallel linear programming in fixed dimension almost surely in constant time, J Assoc Comput Mach 41 (1994), 422-434.
5. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 1992.
6. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discrete Comput Geom 9 (1993), 81-100.
7. G. Ausiello, P. G. Franciosa, and G. F. Italiano, "Small stretch spanners on dynamic graphs," Proceedings of the 13th Annual European Symposium on Algorithms, Vol. 3669 of LNCS, Springer, 2005, pp. 532-543.
8. B. Awerbuch, Complexity of network synchronization, J Assoc Comput Mach 32(4) (1985), 804-823.
9. B. Awerbuch, A. Baratz, and D. Peleg, Efficient broadcast and light weight spanners, Tech Rep CS92-22, Weizmann Institute of Science, 1992.
10. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Near-linear time construction of sparse neighborhood covers, SIAM J Comput 28 (1998), 263-277.
11. H. J. Bandelt and A. W. M. Dress, Reconstructing the shape of a tree from observed dissimilarity data, J Adv Appl Math 7 (1986), 309-343.
12. H. Bast and T. Hagerup, "Fast and reliable parallel hashing," Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architecture (SPAA), 1991, pp. 50-61.
13. H. Bast and T. Hagerup, Fast parallel space allocation, estimation and integer sorting, Inform Computat 123 (1995), 72-110.
14. 2 polylog n) time," Proceedings of the 22nd Annual Symposium on Theoretical Aspect of Computer Science, Vol. 3404 of LNCS, Springer, 2005, pp. 666-679.
15. 2) time," Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 271-280.
16. S. Baswana, K. Telikepalli, K. Mehlhorn, and S. Pettie, "New construction of (α, β)-spanners and purely additive spanners," Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 672-681.
17. O. Berkman and U. Vishkin, Recursive star-tree parallel data structure, SIAM J Comput 22 (1993), 221-242.
18. S. Bhatt, F. Chung, F. T. Leighton, and A. Rosenberg, "Optimal simulations of tree machines," Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS), 1986, pp. 274-282.
19. B. Bollobás, Extremal graph theory, Academic Press, 1978.
20. B. Bollobás, D. Coppersmith, and M. Elkin, "Sparse distance preserves and additive spanners," Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp. 414-423.
21. J. A. Bondy and M. Simonovits, Cycles of even length in graphs, J Combinator Theor B 16 (1974), 97-105.
22. E. Cohen, Fast algorithms for constructing t-spanners and paths with stretch t, SIAM J Comput 28 (1998), 210-236.
23. D. Coppersmith and M. Elkin, "Sparse source-wise and pairwise distance preservers," Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 660-669.
24. D. Dor, S. Halperin, and U. Zwick, All pairs almost shortest paths, SIAM J Comput 29 (2000), 1740-1759.
25. M. Elkin and D. Peleg, (1 + ∈, β)-spanner construction for general graphs, SIAM J Comput 33 (2004), 608-631.
26. P. Erds, "Extremal problems in graph theory," Theory of graphs and its applications (Proc. Sympos. Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., Prague, 1964, pp. 29-36.
27. S. Halperin and U. Zwick, Linear time deterministic algorithm for computing spanners for unweighted graphs, unpublished manuscript, 1996.
28. U. Meyer, P. Sanders, and J. F. Sibeyn, Algorithms for memory hierarchies: Advanced lectures [Dagstuhl Research Seminar, March 10-14, 2002], Vol. 2625 of LNCS, Springer, 2003.
29. D. Peleg and A. Schäffer, Graph spanners, J Graph Theor 13 (1989), 99-116.
30. D. Peleg and J. D. Ullman, An optimal synchronizer for the hypercube, SIAM J Comput 18 (1989), 740-747.
31. D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, J Assoc Comput Mach 36(3) (1989), 510-530.
32. P. Ragde, The parallel simplicity of compaction and chaining, J Algor 14 (1993), 371-380.
33. J. H. Reif, Synthesis of parallel algorithms, Morgan Kaufmann Publishers, California, 1993.
34. L. Roditty, M. Thorup, and U. Zwick, "Deterministic construction of approximate distance oracles and spanners," Proceedings of the 32nd International Colloquim on Automata, Languagaes and Programming (ICALP), Vol. 3580 of LNCS, Springer, 2005, pp. 261-272.
35. L. Roditty and U. Zwick, "On dynamic shortest paths problems," Proceedings of the 12th Annual European Symposium on Algorithms (ESA), Vol. 3221 of LNCS, Springer, 2004, pp. 580-591.
36. J. D. Salowe, "Construction of multidimensional spanner graphs, with application to minimum spanning trees," ACM Symposium on Computational Geometry, 1991, pp. 256-261.
37. M. Thorup and U. Zwick, Approximate distance oracles, J Assoc Comput Mach 52 (2005), 1-24.
38. M. Thorup and U. Zwick, "Spanners and emulators with sublinear distance errors," Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, to appear, 2006.