Efficient algorithms for constructing (1+6, β)-spanners in the distributed and streaming models

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 160-168

  Elkin, Michael ^a   Zhang, Jian ^a  

^a Yale University   (United States)

Author keywords

Almost shortest paths; Spanner; Streaming model

Indexed keywords

ACOUSTIC STREAMING; ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING;

ALMOST SHORTEST PATHS; CIRCUIT PROBLEMS; SPANNER; STREAMING MODELS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 10444268836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SI AM Journal on Computing, 28(4):1167-1181, 1999.
2. N. Alon, Z. Galil, and O. Margalit. On the exponet of the all pairs shortest path problem. In Proc. 32st IEEE Symposium on Foundations of Computer Science, pages 569-575, 1991.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998.
5. B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Saks. Adapting to asynchronous dynamic networks. In Proc. 24th ACM Symposium on Theory of Computing, pages 557-570, 1992.
6. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pages 514-522, 1990.
7. B. Awerbuch and D. Peleg. Routing with polynomial communication-space tradeoff. SIAM Journal on Discrete Mathematics, 5:151-162, 1992.
8. A.L. Buchsbaum, R. Giancarlo and J.R. Westbrook. On finding common neighborhoods in massive graphs. Theoretical Computer Science, 299 (1-3):707-718, 2003.
9. 1+1/k) size in weighted graphs. In Proc. International Colloq. on Automata, Languages and Computing, pages 284-296, 2003.
10. S. Baswana and S. Sen. Approximate distance oracles for unweighted graphs in o(n2 log n) time. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, 2004.
11. B. Chandra, G. Das, G. Narasimhan, and J. Scares. New sparseness results on graph spanners. In Proc 8th ACM Symposium on Computational Geometry, pages 192-201, 1992.
12. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proc. 35th ACM Symposium on Theory of Computing, pages 30-39, 2003.
13. E. Cohen. Fast algorithms for t-spanners and stretch-t paths. In Proc. 34th IEEE Symposium on Foundation of Computer Science, pages 648-658, 1993.
14. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest-paths. In Proc. 26th ACM Symposium on Theory of Computing, pages 16-26, 1994.
15. E. Cohen and U. Zwick. All pairs small stretch paths. Journal of Algorithms, 38:335-353, 2001.
16. D. Coppersmith and R. Kumar. An improved data stream algorithm for frequency moments. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, 2004.
17. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
18. M. Elkin. Computing almost shortest paths. In Proc. 20th ACM Symposium on Principles of Distributed Computing, pages 53-62, 2001.
19. M. Elkin. A fast distributed protocol for constructing the minimum spanning tree. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pages 352-361, 2004.
20. M. Elkin and D. Peleg. (1 + ε, β)-spanner constructions for general graphs. In Proc. 33rd Annual ACM Symp. on Theory of Computing, pages 173-182, 2001.
21. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. To appear in Proc. 31st International Colloquium on Automata, Languages and Programming, 2004.
22. 1 difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
23. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. Journal of Computer and System Sciences, 54(2):243-254, 1997.
24. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proc. 41th IEEE Symposium on Foundations of Computer Science, pages 359-366, 2000.
25. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-001, DEC Systems Research Center, 1998.
26. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41th IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
27. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Math., 5:545-557, 1990.
28. S. Muthukrishnan. Data streams: Algorithms and applications. 2003. Available at http://athos.rutgers.edu/~rnuthu/stream-1-1.ps.
29. D. Peleg. Distributed computing: a locality-sensitive approach. SIAM, Philadelphia, PA, 2000.
30. D. Peleg and A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
31. D. Peleg and J. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18:740-747, 1989.
32. D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables. Journal of ACM, 36(3):510-530, 1989.
33. L. Roditty, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pages 844-851, 2002.
34. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graph. Journal of Computer and System Sciences, 51(3):400-403, 1995.
35. U. Zwick. Exact and approximate distances in graphs - a survey. In Proc. 9th European Symposium on Algorithms, pages 33-48, 2001.