Skip to main content
SpringerLink
Log in

Distributed algorithms for ultrasparse spanners and linear size skeletons

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, sparseness, and distortion. All of our algorithms assume a synchronized distributed network, where relatively short messages may be communicated in each time step. Our first result is a fast distributed algorithm for finding an \({O(2^{{\rm log}^{*} n} {\rm log} n)}\) -spanner with size O(n). Besides being nearly optimal in time and distortion, this algorithm appears to be the first that constructs an O(n)-size skeleton without requiring unbounded length messages or time proportional to the diameter of the network. Our second result is a new class of efficiently constructible (α, β)-spanners called Fibonacci spanners whose distortion improves with the distance being approximated. At their sparsest Fibonacci spanners can have nearly linear size, namely \({O(n(\log \log n)^{\phi})}\) , where \({\phi = (1 + \sqrt{5})/2}\) is the golden ratio. As the distance increases the multiplicative distortion of a Fibonacci spanner passes through four discrete stages, moving from logarithmic to log-logarithmic, then into a period where it is constant, tending to 3, followed by another period tending to 1. On the lower bound side we prove that many recent sequential spanner constructions have no efficient counterparts in distributed networks, even if the desired distortion only needs to be achieved on the average or for a tiny fraction of the vertices. In particular, any distance preservers, purely additive spanners, or spanners with sublinear additive distortion must either be very dense, slow to construct, or have very weak guarantees on distortion.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: upper bounds. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 217–224 (2006)

  2. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: Proceedings of the 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) pp. 20–24 (2004)

  3. Aingworth D., Chekuri C., Indyk P., Motwani R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167–1181 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Althöfer I., Das G., Dobkin D., Joseph D., Soares J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Baswana S.: Streaming algorithm for graph spanners—single pass and constant processing time per edge. Inf. Proc. Lett. 106(3), 110–114 (2008)

    Article  MathSciNet  Google Scholar 

  6. Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 591–602. (2006)

  7. Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: Additive spanners and (α, β)-spanners. ACM Trans. on Algorithms (2009)

  8. Baswana, S., Sarkar, S.: Fully dynamic algorithms for graph spanners with poly-logaritmic update time. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1125–1134 (2008)

  9. Baswana S., Sen S.: Approximate distance oracles for unweighted graphs in expected O(n 2 log n) time. ACM Trans. Algorithms 2(4), 557–577 (2006)

    Article  MathSciNet  Google Scholar 

  10. Baswana S., Sen S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. J. Random Struct. Algs. 30(4), 532–563 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cowen L.J.: Compact routing with minimum stretch. J. Algor. 28, 170–183 (2001)

    Article  MathSciNet  Google Scholar 

  12. Cowen L.J., Wagner C.G.: Compact roundtrip routing in directed networks. J. Algor. 50(1), 79–95 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Derbel B., Gavoille C.: Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. 399(1–2), 83–100 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Derbel, B., Gavoille, C., Peleg D.: Deterministic distributed construction of linear stretch spanners in polylogarithmic time. In: Proceedings of the 21st International Symposium on Distributed Computing (DISC) pp. 179–192. (2007)

  15. Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: Proceedings 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 273–282. (2008)

  16. Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: Local computation of nearly additive spanners. In: Proceedings 23rd International Symposium on Distributed Computing (DISC), LNCS volume 5805, pp. 176–190. (2009)

  17. Dor D., Halperin S., Zwick U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740–1759 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Dubhashi D., Mei A., Panconesi A., Radhakrishnan J., Srinivasan A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4), 467–479 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Elkin M.: Computing almost shortest paths. ACM Trans. Algorithms 1(2), 283–323 (2005)

    Article  MathSciNet  Google Scholar 

  20. Elkin, M.: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In: Proceedings of the 26th International Symposium on Principles of Distributed Computing (PODC), pp. 185–194 (2007)

  21. Elkin, M.: Streaming and fully dynamic centralized algorithms for maintaining sparse spanners. In: Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 716–727 (2007)

  22. Elkin, M., Peleg, D.: \({(1+\epsilon, \beta)}\) -spanner constructions for general graphs. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 173–182 (2001)

  23. Elkin M., Peleg D.: \({(1+\epsilon, \beta)}\) -spanner constructions for general graphs. SIAM J. Comput. 33(3), 608–631 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  24. Elkin M., Zhang J.: Efficient algorithms for constructing \({(1+\epsilon, \beta)}\) -spanners in the distributed and streaming models. Distrib. Comput. 18(5), 375–385 (2006)

    Article  Google Scholar 

  25. Erdős, P.: Extremal problems in graph theory. In Theory of Graphs and its Applications (Proceedings of Symposium Smolenice, 1963), pp. 29–36. Publ. House Czechoslovak Acad. Sci., Prague (1963)

  26. Gavoille C., Peleg D., Pérennes S., Raz R.: Distance labeling in graphs. J. Algor. 53, 85–112 (2004)

    Article  MATH  Google Scholar 

  27. Mendel M., Naor A.: Ramsey partitions and proximity data structures. J. Eur. Math. Soc 9(2), 253–275 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  28. Narasimhan G., Smid M.: Geometric Spanner Networks. Cambridge University Press, Cambridge, England (2007)

    Book  MATH  Google Scholar 

  29. Panconesi, A.: Personal communication (2008)

  30. Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM (2000)

  31. Peleg D., Upfal E.: A trade-off between space amd efficiency for routing tables. J. ACM 36(3), 510–530 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  32. Pettie, S.: Low distortion spanners. ACM Trans. on Algorithms (to appear)

  33. Pettie, S.: Low distortion spanners. In: Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 78–89 (2007)

  34. Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 844–851 (2002)

  35. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 261–272 (2005)

  36. Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: Proceedings of the 12th Annual European Symposium on Algorithms (ESA), pp. 580–591 (2004)

  37. Thorup, M. Zwick, U.: Compact routing schemes. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)

  38. Thorup M., Zwick U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  39. Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 802–809 (2006)

  40. Wenger R.: Extremal graphs with no C 4s, C 6s, or C 10s. J. Comb. Theory Ser. B 52(1), 113–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  41. Woodruff, D.: Lower bounds for additive spanners, emulators, and more. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 389–398 (2006)

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA

    Seth Pettie

Authors
  1. Seth Pettie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seth Pettie.

Additional information

This work is supported by NSF CAREER grant no. CCF-0746673.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pettie, S. Distributed algorithms for ultrasparse spanners and linear size skeletons. Distrib. Comput. 22, 147–166 (2010). https://doi.org/10.1007/s00446-009-0091-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-009-0091-7

Keywords

Search

Navigation